Combinatorial optimization: algorithms and complexity
Citations
17,420 citations
Cites methods from "Combinatorial optimization: algorit..."
...Discrete optimization problems are not addressed directly in this book; we refer the reader to the texts by Papadimitriou and Steiglitz [235], Nemhauser and Wolsey [224], Cook et al....
[...]
...Network and integer optimization are described in some excellent texts: for instance, Ahuja, Magnanti, and Orlin [1] in the case of network optimization and Nemhauser and Wolsey [224], Papadimitriou and Steiglitz [235], and Wolsey [312] in the case of integer programming....
[...]
8,059 citations
6,693 citations
Cites methods from "Combinatorial optimization: algorit..."
...This is an instance of the square assignment (or weighted bipartite matching) problem, which can be solved in O(N(3)) time using the Hungarian method [42]....
[...]
6,340 citations
Cites background from "Combinatorial optimization: algorit..."
...The lattices developed in this section were introduced in [292] for analyzing the kinodynamic planning problem in the rigorous approximation algorithm framework for NP-hard problems [768]....
[...]
...5 One technical point: It is actually only pseudopolynomial [768] in amax , vmax , c0, c1, and the width of the bounding cube in W ....
[...]
5,629 citations
Cites background or methods from "Combinatorial optimization: algorit..."
...However, because the complexity of computing a maximum matching [41] is in general higher than that of computing a maximal...
[...]
...In our multilevel nested dissection algorithm (MLND) a vertex separator is computed from an edge separator by finding the minimum vertex cover [41, 44]....
[...]