Greedy algorithms for max sat and maximum matching: their power and limitations

[1]  Pushkar Tripathi,et al.  Allocation problems with partial information , 2012 .

[2]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[3]  Harold N. Gabow,et al.  An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs , 1976, JACM.

[4]  Mihalis Yannakakis,et al.  On the approximation of maximum satisfiability , 1992, SODA '92.

[5]  Ran Duan,et al.  A scaling algorithm for maximum weight matching in bipartite graphs , 2012, SODA.

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

[7]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[8]  Zevi Miller,et al.  On randomized greedy matchings , 1997, Random Struct. Algorithms.

[9]  Aranyak Mehta,et al.  Online bipartite matching with unknown distributions , 2011, STOC '11.

[10]  Anke van Zuylen.  Simpler 3/4-Approximation Algorithms for MAX SAT , 2011, WAOA.

[11]  Richard M. Karp,et al.  Maximum Matchings in Sparse Random Graphs , 1981, FOCS 1981.

[12]  Telikepalli Kavitha,et al.  Efficient algorithms for maximum weight matchings in general graphs with small edge weights , 2012, SODA.

[13]  Ran Duan,et al.  Approximating Maximum Weight Matching in Near-Linear Time , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

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

[15]  Harish Sethu,et al.  Degree-sequenced matching algorithms for input-queued switches , 2007, Telecommun. Syst..

[16]  Rajeev Motwani,et al.  Lecture notes on approximation algorithms: Volume I , 1993 .

[17]  Peter Slavík.  A Tight Analysis of the Greedy Algorithm for Set Cover , 1997, J. Algorithms.

[18]  Andrew C. Yao,et al.  Lower bounds by probabilistic arguments , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[19]  J. Ian Munro,et al.  A O(|V|·|E|) algorithm for maximum matching of graphs , 2005, Computing.

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

[21]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[22]  Dorit S. Hochbaum,et al.  A Fast Perfect-Matching Algorithm in Random Graphs , 1990, SIAM J. Discret. Math..

[23]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[24]  Béla Bollobás,et al.  Almost all Regular Graphs are Hamiltonian , 1983, European journal of combinatorics (Print).

[25]  Richard M. Karp,et al.  An optimal algorithm for on-line bipartite matching , 1990, STOC '90.

[26]  Lars Engebretsen.  Simplified tight analysis of Johnson's algorithm , 2004, Inf. Process. Lett..

[27]  D. R. Fulkerson,et al.  Transversals and Matroid Partition , 1965 .

[28]  Russell Impagliazzo,et al.  Models of Greedy Algorithms for Graph Problems , 2004, SODA '04.

[29]  Uri Zwick,et al.  Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems , 2002, IPCO.

[30]  Aranyak Mehta,et al.  Online budgeted matching in random input models with applications to Adwords , 2008, SODA '08.

[31]  Alvin E. Roth,et al.  Pairwise Kidney Exchange , 2004, J. Econ. Theory.

[32]  Matthias Poloczek,et al.  Randomized variants of Johnson's algorithm for MAX SAT , 2011, SODA '11.

[33]  Martin E. Dyer,et al.  Randomized Greedy Matching , 1991, Random Struct. Algorithms.

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

[35]  H. Whitney.  On the Abstract Properties of Linear Dependence , 1935 .

[36]  Nicholas J. A. Harvey.  Algebraic Algorithms for Matching and Matroid Problems , 2009, SIAM J. Comput..

[37]  Uri Zwick,et al.  A 7/8-approximation algorithm for MAX 3SAT? , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[38]  Uriel Feige,et al.  Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[39]  Matsui Tomomi,et al.  0.935 - Approximation Randomized Algorithm for MAX 2SAT and Its Derandomization , 2001 .

[40]  Gagan Goel,et al.  Matching with Our Eyes Closed , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[41]  Matthias Poloczek.  Bounds on Greedy Algorithms for MAX SAT , 2011, ESA.

[42]  Matthias Poloczek,et al.  Randomized Greedy Algorithms for the Maximum Matching Problem with New Analysis , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

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

[44]  Gottfried Tinhofer.  A probabilistic analysis of some greedy cardinality matching algorithms , 1984, Ann. Oper. Res..

[45]  David P. Williamson,et al.  New 3/4-Approximation Algorithms for the Maximum Satisfiability Problem , 1994, SIAM J. Discret. Math..

[46]  Uri Zwick,et al.  Computer assisted proof of optimal approximability results , 2002, SODA '02.

[47]  Mohammad Mahdian,et al.  Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs , 2011, STOC '11.