Some recent results in the analysis of greedy algorithms for assignment problems

We survey some recent developments in the analysis of greedy algorithms for assignment and transportation problems. We focus on the linear programming model for matroids and linear assignment problems with Monge property, on general linear programs, probabilistic analysis for linear assignment and makespan minimization, and on-line algorithms for linear and non-linear assignment problems.ZusammenfassungEinige neuere Entwicklungen auf dem Gebiet der Analyse von Greedy-Algorithmen für Transport- und Zuordnungsprobleme werden übersichtsartig dargestellt. Das Hauptinteresse gilt linearen Programmiermodellen für Matroide und lineare Zuordnungsprobleme mit Monge-Eigenschaft, allgemeinen linearen Programmen, der probabilistischen Analyse von linearen Zuordnungen und der Makespan-Minimierung sowie On-Line-Algorithmen für lineare und nichtlineare Zuordnungsprobleme.

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

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

[3]  M. Sipser,et al.  Maximum matching in sparse random graphs , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[4]  Ramaswamy Chandrasekaran.  Recognition of Gilmore-Gomory traveling salesman problem , 1986, Discret. Appl. Math..

[5]  Rainer E. Burkard,et al.  The asymptotic probabilistic behaviour of quadratic sum assignment problems , 1983, Z. Oper. Research.

[6]  András Frank,et al.  Generalized polymatroids and submodular flows , 1988, Math. Program..

[7]  Eugene L. Lawler,et al.  The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .

[8]  Satoru Fujishige,et al.  Submodular functions and optimization , 1991 .

[9]  Gerhard J. Woeginger,et al.  On the Recognition of Permuted Bottleneck Monge Matrices , 1993, ESA.

[10]  Mikhail Kovalev,et al.  The canonical order and greedy algorithms , 1995 .

[11]  Ulrich Derigs,et al.  Monge sequences and a simple assignment algorithm , 1986, Discret. Appl. Math..

[12]  Ulrich Faigle.  Combinatorial Geometries: Matroids in Combinatorial Optimization , 1987 .

[13]  Peter Brucker,et al.  Series parallel composition of greedy linear programming problems , 1993, Math. Program..

[14]  N. Alon,et al.  An algorithm for the detection and construction of Monge sequences , 1989 .

[15]  Alan Frieze,et al.  Probabilistic Analysis of Graph Algorithms , 1990 .

[16]  Jacobus Antonius Adelbertus van der Veen.  Solvable cases of the traveling salesman problem with various objective functions , 1992 .

[17]  Richard P. Anstee,et al.  Characterizations of Totally Balanced Matrices , 1984, J. Algorithms.

[18]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[19]  Peter Brucker,et al.  Greedy concepts for network flow problems , 1986, Discret. Appl. Math..

[20]  Henry D. Shapiro,et al.  An Exact Characterization of Greedy Structures , 1993, IPCO.

[21]  Bala Kalyanasundaram,et al.  Online Weighted Matching , 1993, J. Algorithms.

[22]  György Turán,et al.  On the performance of on-line algorithms for partition problems , 1989, Acta Cybern..

[23]  John L. Bruno,et al.  Probabilistic Bounds on the Performance of List Scheduling , 1986, SIAM J. Comput..

[24]  A. Hoffman,et al.  Totally-Balanced and Greedy Matrices , 1985 .

[25]  W. M. Nawijn,et al.  On the expected number of assignments in reduced matrices for the linear assignment problem , 1989 .

[26]  Peter Brucker,et al.  A Monge Property for the D-dimensional Transportation Problem , 1995, Discret. Appl. Math..

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

[28]  Peter Brucker,et al.  Minimum cost flow algorithms for series-parallel networks , 1985, Discret. Appl. Math..

[29]  P. Erdos,et al.  Old and new problems and results in combinatorial number theory , 1980 .

[30]  Robert E. Tarjan,et al.  On a Greedy Heuristic for Complete Matching , 1981, SIAM J. Comput..

[31]  Martin E. Dyer,et al.  Randomized Greedy Matching II , 1995, Random Struct. Algorithms.