Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Integer and combinatorial optimization
Integer and combinatorial optimization
Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
Finding a minimum weight K-link path in graphs with Monge property and applications
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
We continue the research on the effects of Monge structures in the area of combinatorial optimization. We show that three optimization problems become easy if the underlying cost matrix fulfills the Monge property: (A) The balanced max-cut problem, (B) the problem of computing minimum weight binary k-matchings and (C) the computation of longest paths in bipartite, edge-weighted graphs. In all three results, we first prove that the Monge structure imposes some special combinatorial property on the structure of the optimum solution, and then we exploit this combinatorial property to derive efficient algorithms.