Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems

Many real-world problems require graphs of such large size that polynomial time algorithms are too costly as soon as their runtime is superlinear. Examples include problems in VLSI-design or problems in bioinformatics. For such problems the question arises: What is the best solution that can be obtained in linear time? We survey linear time approximation algorithms for some classical problems from combinatorial optimization, e.g. matchings and branchings.

[1]  Valentin Ziegler,et al.  Approximating optimum branchings in linear time , 2009, Inf. Process. Lett..

[2]  Robert E. Tarjan,et al.  Efficient algorithms for finding minimum spanning trees in undirected and directed graphs , 1986, Comb..

[3]  Kurt Mehlhorn,et al.  Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures , 2000, Algorithm Engineering.

[4]  Norbert Blum,et al.  A New Approach to Maximum Matching in General Graphs , 1990, ICALP.

[5]  Rajeev Motwani,et al.  Clique partitions, graph compression and speeding-up algorithms , 1991, STOC '91.

[6]  Harold N. Gabow,et al.  Data structures for weighted matching and nearest common ancestors with linking , 1990, SODA '90.

[7]  William J. Cook,et al.  Computing Minimum-Weight Perfect Matchings , 1999, INFORMS J. Comput..

[8]  András Frank,et al.  On Kuhn's Hungarian Method—A tribute from Hungary , 2005 .

[9]  Kurt Mehlhorn,et al.  Maximum Network Flow with Floating Point Arithmetic , 1998, Inf. Process. Lett..

[10]  Peter Sanders,et al.  A simpler linear time 2/3-epsilon approximation for maximum weight matching , 2004, Inf. Process. Lett..

[11]  Shimon Even,et al.  An O (N2.5) algorithm for maximum matching in general graphs , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[12]  Robert Preis,et al.  Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs , 1999, STACS.

[13]  George Karypis,et al.  Multilevel k-way Partitioning Scheme for Irregular Graphs , 1998, J. Parallel Distributed Comput..

[14]  Harold N. Gabow,et al.  An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems , 1983, STOC.

[15]  B. Korte,et al.  An Analysis of the Greedy Heuristic for Independence Systems , 1978 .

[16]  Dieter Jungnickel,et al.  Balanced network flows. VIII. A revised theory of phase‐ordered algorithms and the O( $\bf\it\sqrt{n}m$ log(n2/m)/log n) bound for the nonbipartite cardinality matching problem , 2003, Networks.

[17]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[18]  Refael Hassin,et al.  Maximizing the Number of Unused Colors in the Vertex Coloring Problem , 1994, Inf. Process. Lett..

[19]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[20]  P. Sanders,et al.  A simpler linear time 2 / 3 − ε approximation for maximum weight matching , 2004 .

[21]  Vijay V. Vazirani,et al.  A theory of alternating paths and blossoms for proving correctness of the $$O(\sqrt V E)$$ general graph maximum matching algorithm , 1990, Comb..

[22]  C Berge,et al.  TWO THEOREMS IN GRAPH THEORY. , 1957, Proceedings of the National Academy of Sciences of the United States of America.

[23]  Stefan Hougardy,et al.  Linear Time Local Improvements for Weighted Matchings in Graphs , 2003, WEA.

[24]  Fritz Bock.  An algorithm to construct a minimum directed spanning tree in a directed network , 1971 .

[25]  Andrew V. Goldberg,et al.  Approximating Matchings in Parallel , 1993, Inf. Process. Lett..

[26]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[27]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

[28]  Robert E. Tarjan,et al.  Algorithms for Two Bottleneck Optimization Problems , 1988, J. Algorithms.

[29]  Robert E. Tarjan,et al.  Faster scaling algorithms for general graph matching problems , 1991, JACM.

[30]  Piotr Sankowski,et al.  Maximum matchings via Gaussian elimination , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[31]  Rajeev Motwani,et al.  Average-case analysis of algorithms for matchings and related problems , 1994, JACM.

[32]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[33]  Kurt Mehlhorn,et al.  Matching Algorithms Are Fast in Sparse Random Graphs , 2004, STACS.

[34]  Yossi Shiloach.  Another Look at the Degree Constrained Subgraph Problem , 1981, Inf. Process. Lett..

[35]  Stefan Hougardy,et al.  A simple approximation algorithm for the weighted matching problem , 2003, Inf. Process. Lett..

[36]  Silvio Micali,et al.  An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[37]  Andrew V. Goldberg,et al.  Maximum skew-symmetric flows and matchings , 2004, Math. Program..

[38]  Julián Mestre,et al.  Greedy in Approximation Algorithms , 2006, ESA.

[39]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[40]  Stefan Hougardy,et al.  A linear-time approximation algorithm for weighted matchings in graphs , 2005, TALG.

[41]  J. Petersen.  Die Theorie der regulären graphs , 1891 .

[42]  Nicholas J. A. Harvey.  Algebraic Structures and Algorithms for Matching and Matroid Problems , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).