An optimisation algorithm for maximum independent set with applications in map labelling

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

Volumn 1643, Issue , 1999, Pages 426-437

  Verweij, Bram ^a   Aardal, Karen ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BRANCH AND BOUND METHOD; FORESTRY; INTEGER PROGRAMMING; SET THEORY; TREES (MATHEMATICS);

BRANCH-AND-CUT ALGORITHMS; COMPUTATIONAL EXPERIMENT; COMPUTING TIME; DISTINCT POINTS; INDEPENDENT SET; INDEPENDENT SET PROBLEMS; MAXIMUM INDEPENDENT SETS; OPTIMAL SOLUTIONS;

OPTIMIZATION;

EID: 84958043682     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48481-7_37     Document Type: Conference Paper

References (30)

1. P. K. Agarwal, M. van Kreveld, and S. Suri. Label placement by maximum independent set in rectangles. Comp. Geom. Theory and Appl., 11:209-218, 1998.
2. L. Babel. Finding maximum cliques in arbitrary and special graphs. Computing, 46(4):321-341, 1991.
3. L. Babel and G. Tinhofer. A branch and bound algorithm for the maximum clique problem. ZOR -Methods and Models of Opns. Res., 34:207-217, 1990.
4. V. Bafna, B. O. Narayanan, and R. Ravi. Non-overlapping local alignments (weighted independent sets of axis parallel rectangles). In Selim G. Akl, Frank K. H. A. Dehne, Jörg-Rüdiger Sack, and Nicola Santoro, editors, Proc. 4th Int. Workshop on Alg. and Data Structures,volume 955 of Lec. Notes Comp. Sci., pages 506-517. Springer-Verlag, 1995.
5. E. Balas and J. Xue. Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring. Algorithmica, 15:397-412, 1996.
6. E. Balas and C. S. Yu. Finding a maximum clique in an arbitrary graph. SIAM J. On Comp., 15:1054-1068, 1986.
7. R. Carraghan and P. M. Pardalos. An exact algorithm for the maximum clique problem. Opnl. Res. Letters, 9:375-382, 1990.
8. J. Christensen, J. Marks, and S. Shieber. An empirical study of algorithms for point-feature label placement. ACM Trans. On Graphics, 14(3):203-232, 1995.
9. R. G. Cromley. An LP relaxation procedure for annotating point features using interactive graphics. In Proc. AUTO-CARTO VII, pages 127-132, 1985.
10. S. van Dijk, D. Thierens, and M. de Berg. On the design of genetic algorithms for geographical applications. In W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith, editors, Proc. of the Genetic and Evolutionary Comp. Conf. (GECCO-99). Morgan Kaufmann, Jul 1999.
11. E. Dijkstra. A note on two problems in connexion with graphs. Numeriche Mathematics, 1:269-271, 1959.
12. B. de Fluiter. Algorithms for Graphs of Small Treewidth. PhD thesis, Utrecht University, Utrecht, 1997.
13. M. Formann and F. Wagner. A packing problem with applications to lettering of maps. In Proc. 7th Ann. ACMSymp. Comp. Geom., pages 281-288, 1991.
14. C. Friden, A. Hertz, and D. de Werra. An exact algorithm based on tabu search for finding a maximum independent set in graph. Comp. Opns. Res., 17(5):375-382, 1990.
15. M. Grotschel, L. Lovasz, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, Berlin, 1988.
16. ILOG, Inc. CPLEX Devision. Using the CPLEX Callable Library, 1997.
17. K. G. Kakoulis and I. G. Tollis. A unified approach to labeling graphical features. In Proc. 14th Ann. ACMSymp. Comp. Geom., pages 347-356, 1998.
18. L. Kucera, K. Mehlhorn, B. Preis, and E. Schwarzenecker. Exact algorithms for a geometric packing problem. In Proc. 10th Symp. Theo. Aspects Comp. Sci., volume 665 of Lec. Notes Comp. Sci., pages 317-322. Springer-Verlag, 1993.
19. J. T. Linderoth and M. W. P. Savelsbergh. A computational study of search strategies for mixed integer programming. INFORMS J. On Comp., to appear.
20. C. Mannino and A. Sassano. An exact algorithm for the maximum stable set problem. Comp. Optn. and Appl., 3:243-258, 1994.
21. K. Mehlhorn, S. Naher, and C. Uhrig. The LEDA User Manual Version 3.7. Max-PlanckInstitut für Informatik, Saarbrücken, 1998.
22. G. L. Nemhauser and G. Sigismondi. A strong cutting plane/branch-and-bound algorithm for node packing. J. of the Opns. Res. Soc., 43(5):443-457, 1992.
23. M. W. Padberg. On the facial structure of set packing polyhedra. Mathematical Programming, 5:199-215, 1973.
24. F. Rossi and S. Smriglio. A branch-and-cut algorithm for the maximum cardinality stable set problem. Technical Report 353, "Centro Vito Volterra"-Universita di Roma Tor Vergata, Jan 1999.
25. E. C. Sewell. A branch and bound algorithm for the stability number of a sparse graph. INFORMS J. On Comp., 10(4):438-447, 1998.
26. F. Wagner and A. Wolff. An efficient and effective approximation algorithm for the map labeling problem. In P. Spirakis, editor, Proc. 3rd Ann. Eur. Symp. On Alg., volume 979 of Lec. Notes Comp. Sci., pages 420-433. Springer-Verlag, 1995.
27. L. Wolsey. Integer Programming. John Wiley & Sons, Inc., New York, 1998.
28. J. Xue. Fast algorithms for the vertex packing problem. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, 1991.
29. S. Zoraster. Integer programming applied to the map label placement problem. Cartographica, 23(3):16-27, 1986.
30. S. Zoraster. Thesolutionoflarge0-1 integerprogrammingproblemsencounteredinautomated cartography. Opns. Res., 38(5):752-759, 1990.