only minimal imperfect graphs are odd holes and the complements of odd holes. This famous conjecture was nally proved shortly after the publication of this book[1]. Packing and covering properties of various clutters including two commodity ows, r cuts and r arborescences, T cuts and T joins, and odd cycles are the subject of chapters one through ve of the book. In chapters six and seven, the approach is extended to balanced and totally unimodular matrices with 0, 1, and -1 entries. In chapters eight, nine, and ten, Cornu´jols discusses e decompositions of matroids, balanced matrices, and perfect graphs. The book is written in very dense de nition theorem proof style, with relatively little motivation. Although a number of exercises are scattered throughout the book, the style of presentation makes this book unsuitable for use as an introduction to the topic. Readers looking for an applications oriented introduction to this material will nd an excellent one in the combinatorial optimization textbook by Nemhauser and Wolsey[2]. Cornu´jols book can be recommended as an authoritative reference for graduate students and e researchers working in this area. However, it is already beginning to be outdated by new developments. The author o
End of preview. The entire article is 4 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/review-of-ordered-sets-an-introduction-hPhGMfPhrT
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Review of ordered sets: an introduction
Schröder, Bernd S.W.
Follow ACM SIGACT News
, Volume 39 (3)
Association for Computing Machinery – Sep 1, 2008
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
