Elimination Graphs

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

Volumn 5555 LNCS, Issue PART 1, 2009, Pages 774-785

  Ye, Yuli ^a   Borodin, Allan ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CHORDAL GRAPHS; CONVEX OBJECTS; INDUCED CYCLE; INTERSECTION GRAPH; NP COMPLETE PROBLEMS; PLANAR GRAPH; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; TWO DIMENSIONAL PLANE;

APPROXIMATION ALGORITHMS; LINGUISTICS; POLYNOMIAL APPROXIMATION; TRANSLATION (LANGUAGES);

GRAPH THEORY;

EID: 70449083284     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02927-1_64     Document Type: Conference Paper

References (36)

1. Akcoglu, K., Aspnes, J., DasGupta, B., Kao, M.-Y.: Opportunity Cost Algorithms for Combinatorial Auctions. Applied Optimization 74: Computational Methods in Decision-Making, Economics and Finance, 455-479 (2002)
2. Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. Journal of the Association for Computing Machinery 41(1), 153-180 (1994)
3. Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., Schieber, B.: A unified approach to approximating resource allocation and scheduling. JACM 48(5), 1069-1090 (2001)
4. Bar-Noy, A., Guha, S., Naor, J., Schieber, B.: Approximating the throughput of multiple machines in real-time scheduling. SI AM Journal on Computing 31(2), 331-352 (2001)
5. Bar-Yehuda, R., Bendel, A., Freund, A., Rawitz, D.: Local ratio: A unied framework for approxmation algorithms in memoriam: Shimon Even 1935-2004. Computing Surveys 36, 422-463 (2004)
6. Bar-Yehuda, R., Even, S.: On approximating a vertex cover for planar graphs. In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pp. 303-309 (1982)
7. Berman, P.: A d\2 approximation for maximum weight independent set in d-claw free graphs. Nord. J. Comput. 7(3), 178-184 (2000)
8. Berman, P., DasGupta, B.: Improvements in throughout maximization for realtime scheduling. In: STOC, pp. 680-687 (2000)
9. Berman, P., DasGupta, B.: A simple approximation algorithm for nonoverlapping local alignments (Weighted Independent Sets of Axis Parallel Rectangles). Biocomputing 1, 129-138 (2002)
10. Borodin, A., Cashman, D., Magen, A.: How well can primal-dual and local-ratio algorithms perform? In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 943-955. Springer, Heidelberg (2005)
11. Borodin, A., Nielsen, M., Rackoff, C.: (Incremental) priority algorithms. In: SODA, pp. 752-761 (2002)
12. Butman, A., Hermelin, D., Lewenstein, M., Rawitz, D.: Optimization problems in multiple-interval graphs. In: Proceedings of SODA 2007, pp. 268-277 (2007)
13. Chakaravarthy, V.T., Roy, S.: Approximating maximum weight K-colorable subgraphs in chordal graphs. Information Processing Letters (to appear)
14. Chmeiss, A., Jégou, P.: A generalization of chordal graphs and the maximum clique problem. Information Processing Letters 62, 61-66 (1997)
15. Chuzhoy, J., Ostrovsky, R., Rabani, Y.: Approximation algorithms for the job interval selection problem and related scheduling problems. Mathematics of Operations Research 31(4), 730-738 (2006)
16. Edmonds, J.: Paths, trees, and flowers. Canad. J. Math. 17, 449-467 (1965)
17. Eisenbrand, F., Grandoni, F.: On the complexity of fixed parameter clique and dominating set. Theoretical Computer Science 326(1-3), 57-67 (2004)
18. Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pacific J. Math. 15, 835-855 (1965)
19. Gavril, F.: Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximun independent set of a chordal graph. SIAM Journal on Computing 1(2), 180-187 (1972)
20. Griggs, J.R., West, D.B.: Extremal values of the interval number of a graph. SIAM Journal on Algebraic and Discrete Methods 1(1), 1-14 (1980)
21. Hajnal, A., Surányi, J.: Über die Auflösung von Graphen in Voltständige Teilgraphen. Annales Universitatis Sci. Budapestiensis 1, 113-121 (1958)
22. Hayward, R.: Weakly triangulated graphs. J. Comb. Theory 39, 200-208 (1985)
23. Hochbaum, D.: Efficient bounds for the stable set, vertex cover, and set packing problems. Discrete Applied Mathematics 6, 243-254 (1983)
24. Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM Journal of Computing 7, 413-423 (1978)
25. Jamison, R.E., Mulder, H.M.: Tolerance intersection graphs on binary trees with constant tolerance 3. Discrete Math. 215, 115-131 (2000)
26. Marathe, M.V., Breu, FL, Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple Heuristics for Unit Disk Graphs. Networks 25, 59-68 (1995)
27. Minty, G.J.: On maximal independent sets of vertices in claw-free graphs. Journal of Combinatorial Theory B-28, 284-304 (1980)
28. Nakamura, D., Tamura, A.: A revision of Minty's algorithm for finding a maximum weighted stable set of a claw-free graph. Journal of the Operations Research Society of Japan 44(2), 194-204 (2001)
29. Rose, D.J.: Triangulated graphs and the elimination process. J. Math. Anal. Appl. 32, 597-609 (1970)
30. Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertexelimination on graphs. SIAM J. Cornput. 5, 266-283 (1976)
31. Spieksma, F.C.R.: On the approximability of an interval scheduling problem. Journal of Scheduling 2, 215-227 (1999)
32. Tarjan, R.E.: Maximum cardinality search and chordal graphs. Lecture Notes CS 259 (unpublished, 1976)
33. Trotter Jr., W.T., Harary, F.: On double and multiple interval graphs. Journal of Graph Theory 3(3), 205-211 (1979)
34. West, D.B.: Parameters of partial orders and graphs: Packing, covering and representation. In: Proceedings of the Conference on Graphs and Order, 1984, Banff, Canada, pp. 267-350. Reidel (1985)
35. West, D.B., Shmoys, D.B.: Recognizing graphs with fixed interval number is NP-complete. Discrete Applied Mathematics 8, 295-305 (1984)
36. Yannakakis, M., Gavril, F.: The maximum k-colorable subgraph problem for chordal graphs. Information Processing Letters 24(2), 133-137 (1987)