Recognizing Greedy Structures

We study decision problems of the following form: Given an instance of a combinatorial problem, can it be solved by a greedy algorithm? We present algorithms for the recognition of greedy instances of certain problems, structural characterization of such instances for other problems, and proofs ofNP-hardness of the recognition problem for some other cases. Previous results of this type are also stated and reviewed.

[1]  David P. Summer.  Randomly matchable graphs , 1979, J. Graph Theory.

[2]  Gary Chartrand,et al.  Randomly hamiltonian digraphs , 1969 .

[3]  Gary Chartrand,et al.  Randomly Traceable Graphs , 1968 .

[4]  David G. Kirkpatrick,et al.  On the completeness of a generalized matching problem , 1978, STOC.

[5]  András Gyárfás,et al.  On-line and first fit colorings of graphs , 1988, J. Graph Theory.

[6]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[7]  V. Chvátal,et al.  A Note on Well-Covered Graphs , 1993 .

[8]  Carsten Thomassen,et al.  Graphs in which every finite path is contained in a circuit , 1973 .

[9]  Ramesh S. Sankaranarayana,et al.  Complexity results for well-covered graphs , 1992, Networks.

[10]  Michael Tarsi,et al.  Graph decomposition is NPC - a complete proof of Holyer's conjecture , 1992, STOC '92.

[11]  George J. Minty,et al.  On maximal independent sets of vertices in claw-free graphs , 1980, J. Comb. Theory, Ser. B.

[12]  Michael Tarsi,et al.  Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture , 1997, SIAM J. Comput..

[13]  M. Plummer.  WELL-COVERED GRAPHS: A SURVEY , 1993 .

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  John Frederick Fink.  Randomly antitraceable digraphs , 1982, J. Graph Theory.

[16]  Michael Tarsi,et al.  Well-Covered Claw-Free Graphs , 1996, J. Comb. Theory, Ser. B.

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

[18]  Mihalis Yannakakis,et al.  Node-and edge-deletion NP-complete problems , 1978, STOC.

[19]  Michael Tarsi.  Graphs Where Every Maximal Path Is Maximum , 1996, J. Comb. Theory, Ser. B.