Graph Classes A Survey Bibtex Bibliography

Mihir Bellare, Oded Goldreich, and Madhu Sudan.Free bits, pcps, and nonapproximability - towards tight results.SIAM Journal on Computing, 27(3):804—915, 1998.

This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) the approximability of NP-optimization problems. The emphasis is on proving tight non-approximability results via consideration of measures like the ‘‘free bit complexity” and the ‘‘amortized free bit complexity” of proof systems.
The first part of the paper presents a collection of new proof systems based on a new errorcorrecting code called the long code. We provide a proof system which has amortized free bit complexity of \(2 + \epsilon\), implying that approximating Max Clique within \(N^{\frac{1}{3}-\epsilon}\), and approximating the Chromatic Number within \(N^{\frac{1}{5}-\epsilon}\), are hard assuming NP \(\neq\) coRP, for any \(\epsilon > 0\). We also derive the first explicit and reasonable constant hardness factors for Min Vertex Cover, Max2SAT, and Max Cut, and improve the hardness factor for Max3SAT. We note that our non-approximability factors for MaxSNP problems are appreciably close to the values known to be achievable by polynomial time algorithms. Finally we note a general approach to the derivation of strong non-approximability results under which the problem reduces to the construction of certain ‘‘gadgets.”
The increasing strength of non-approximability results obtained via the PCP connection motivates us to ask how far this can go, and whether PCPs are inherent in any way. The second part of the paper addresses this. The main result is a ‘‘reversal” of the FGLSS connection: where the latter had shown how to translate proof systems for NP into NP-hardness of approximation results for Max Clique, we show how any NP-hardness of approximation result for Max Clique yields a proof system for NP. Roughly our result says that for any constant \(f\) if Max Clique is NP-hard to approximate within N^{1/(1+f)} then \(NP \subseteq \overline{\text{FPCP}}\left[log, f \right]\), the latter being the class of languages possessing proofs of logarithmic randomness and amortized free bit complexity \(f\). This suggests that PCPs are inherent to obtaining non-approximability results. Furthermore the tight relation suggests that reducing the amortized free bit complexity is necessary for improving the non-approximability results for Max Clique.
The third part of our paper initiates a systematic investigation of the properties of PCP and FPCP as a function of the various parameters: randomness, query complexity, free bit complexity, amortized free bit complexity, proof size, etc. We are particularly interested in ‘‘triviality” results, which indicate which classes are not powerful enough to capture NP. We also distill the role of randomized reductions in this are

BibTeX - Abstract - DOI

Graph Classes: a Survey

Preface 1. Basic Concepts 2. Perfection, Generalized Perfection, and Related Concepts 3. Cycles, Chords and Bridges 4. Models and Interactions 5. Vertex and Edge Orderings 6. Posets 7. Forbidden Subgraphs 8. Hypergraphs and Graphs 9. Matrices and Polyhedra 10. Distance Properties 11. Algebraic Compositions and Recursive Definitions 12. Decompositions and Cutsets 13. Threshold Graphs and Related Concepts 14. The Strong Perfect Graph Conjecture Appendix A. Recognition Appendix B. Containment Relationships Bibliography Index.
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.
This publication is from a journal that may support self archiving.
Learn more
A 4-uniform hypergraph represents the P4-structure of a graph G, if its hyperedges are the vertex sets of the induced paths P4 in G. We shall give in this paper a simple algorithm that recognizes the P4-structure of a block graph in polynomial time. Here, block graphs are connected graphs in which all maximal 2-connected subgraphs are cliques. Our algorithm is based on a similar approach as... [Show full abstract]
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k ≥ 2, a graph G = (V G ,E G ) is the k-simplicial power of a graph H = (V H ,E H ) (H a root graph of G) if V G is the set of all simplicial vertices of H, and for all distinct vertices x and y in V G , xy ∈ E G if and only if the distance in H between x and y is at most k. This... [Show full abstract]
Discover more

0 thoughts on “Graph Classes A Survey Bibtex Bibliography

Leave a Reply

Your email address will not be published. Required fields are marked *