Minimum clique cover in claw-free perfect graphs and the weak Edmonds-Johnson property
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Eight-Fifth approximation for the path TSP
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
DBSec'13 Proceedings of the 27th international conference on Data and Applications Security and Privacy XXVII
Capacity-Constrained network-voronoi diagram: a summary of results
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
| Hi-index | 0.00 |
This comprehensive textbook on combinatorial optimization places specialemphasis on theoretical results and algorithms with provably goodperformance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout,it contains complete but concise proofs, and also provides numerousexercises and references. This fifth edition has again been updated, revised, and significantlyextended, with more than 60 new exercises and new material on varioustopics, including Cayley's formula, blocking flows, fasterb-matching separation, multidimensional knapsack, multicommoditymax-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.