A fast algorithm for minimum weight odd circuits and cuts in planar graphs

Authors:
Adam N. Letchford;Nicholas A. Pearson
Affiliations:
Department of Management Science, The Management School, Lancaster University, Lancaster LA1 4YX, UK;Department of Management Science, The Management School, Lancaster University, Lancaster LA1 4YX, UK
Venue:
Operations Research Letters
Year:
2005

Citing 12
Cited 1

On the cut polytope

Mathematical Programming: Series A and B
Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
A new approach to the maximum-flow problem

Journal of the ACM (JACM)
Decomposition and optimization over cycles in binary matroids

Journal of Combinatorial Theory Series B
Implementing an efficient minimum capacity cut algorithm

Mathematical Programming: Series A and B
{0, 12 }-Chva´tal-Gomory cuts

Mathematical Programming: Series A and B
Faster shortest-path algorithms for planar graphs

Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Maximum (s,t)-flows in planar networks in O(|V| log |V|) time

Journal of Computer and System Sciences
Data structures for weighted matching and nearest common ancestors with linking

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A deterministic near-linear time algorithm for finding minimum cuts in planar graphs

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Weakly bipartite graphs and the Max-cut problem

Operations Research Letters
The max-cut problem on graphs not contractible to K5

Operations Research Letters

Exploiting planarity in separation routines for the symmetric traveling salesman problem

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a simple O(n^3^/^2logn) algorithm for finding a minimum weight odd circuit in planar graphs. By geometric duality, the same algorithm can be used to find minimum weight odd cuts. For general sparse graphs, the fastest known algorithms for these two problems take O(n^2logn) time and O(n^3logn) time, respectively.