Abstract
In the remaining part of this book we apply the methods developed in the first part to combinatorial optimization. In this chapter we give some illuminating examples to explain the basic techniques of deriving polynomial time algorithms for combinatorial optimization problems. These techniques are based on combining the ellipsoid method and basis reduction with results from the field called “polyhedral combinatorics”, where combinatorial optimization problems are formulated as linear programs. Chapter 8 contains a comprehensive survey of combinatorial problems to which these methods apply. Finally, in the last two chapters we discuss some more advanced examples in greater detail.KeywordsPolynomial TimeBipartite GraphGreedy AlgorithmPolynomial Time AlgorithmCombinatorial Optimization ProblemThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
