Combinatorial Optimization: Theory and Algorithms

Authors:
Bernhard Korte;Jens Vygen
Affiliations:
-;-
Venue:
Combinatorial Optimization: Theory and Algorithms
Year:
2010

Citing 0
Cited 8

Algorithms for long paths in graphs

Theoretical Computer Science
Modeling Network Transition Constraints with Hypergraphs

Transportation Science
SMI 2011: Full Paper: Template-based quadrilateral meshing

Computers and Graphics
Cost-minimal pre-allocation of software tasks under real-time constraints

Proceedings of the 2011 ACM Symposium on Research in Applied Computation
A detachment algorithm for inferring a graph from path frequency

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Exact decoding of phrase-based translation models through Lagrangian relaxation

EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Interactive Omnidirectional Video Delivery: A Bandwidth-Effective Approach

Bell Labs Technical Journal
Effects of discrete objective functions with different granularities on the search behavior of EMO algorithms

Proceedings of the 14th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Now fully updated in a third edition, this is a comprehensive textbook on combinatorial optimization. It puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. The book contains complete but concise proofs, also for many deep results, some of which have not appeared in print before. Recent topics are covered as well, and numerous references are provided. This third edition contains a new chapter on facility location problems, an area which has been extremely active in the past few years. Furthermore there are several new sections and further material on various topics. New exercises and updates in the bibliography were added.