Approximating maximum diameter-bounded subgraphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6034 LNCS, Issue , 2010, Pages 615-626

  Asahiro, Yuichi ^a   Miyano, Eiji ^b   Samizo, Kazuaki ^b  

^a KYUSHU SANGYO UNIVERSITY   (Japan)

^b KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMABILITY; APPROXIMATION RATIOS; CHORDAL GRAPHS; DIAMETER-BOUNDED; FIXED INTEGERS; HARDNESS RESULT; INTERVAL GRAPH; K-PARTITE GRAPH; MAXIMUM CLIQUE PROBLEMS; N-VERTEX GRAPH; NP-HARD; POLYNOMIAL-TIME ALGORITHMS; SPLIT GRAPHS; SUBGRAPH PROBLEMS; SUBGRAPHS;

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPHIC METHODS; HARDNESS; INFORMATION SCIENCE; POLYNOMIAL APPROXIMATION;

GRAPH THEORY;

EID: 77953518539     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12200-2_53     Document Type: Conference Paper

References (15)

1. Agnarsson, G., Greenlaw, R., Halldórsson, M.M.: On powers of chordal graphs and their colorings. Congr. Numer. 144, 41-65 (2000)
2. Balakrishnan, R., Paulraja, P.: Powers of Chordal Graphs. Australian J. Mathematics, Series A 35, 211-217 (1983)
3. Bellare, M., Goldreich, O., Sudan, M.: Free bits, PCPs and non-approximability - Towards tight results. SIAM J. Computing 27(3), 804-915 (1998)
4. Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Handbook of Combinatorial Optimization, pp. 1-74. Kluwer Academic, Dordrecht (1999)
5. Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM, Philadelphia (1999)
6. Feige, U.: Approximating maximum clique by removing subgraphs. SIAM Journal on Discrete Mathematics 18, 219-225 (2004)
7. Garey, M.R., Johnson, D.S.: Computers and Intractability (1979)
8. Gavril, F.: Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM Journal on Computing 1(2), 180-187 (1972)
9. Goerdt, A., Lanka, A.: An approximation hardness result for bipartite clique. Electronic Colloquium on Computational Complexity, Report No. 48 (2004)
10. 1-ε. Acta Mathematics 182(1), 105-142 (1999)
11. Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85-103 (1972)
12. Marinček, J., Mohar, B.: On approximating the maximum diameter ratio of graphs. Discrete Math. 244, 323-330 (2002) (Pubitemid 34119450)
13. Schröder, B.S.W.: Algorithms for the fixed point property. Theoretical Computer Science 217, 301-358 (1999)
14. Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2003)
15. Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theory of Computing 3, 103-128 (2007)