See this document in CiteSeerX!

Algorithms for Maximum Independent Set Applied to Map (2000)  (Make Corrections)  
Tycho Strijk, Bram Verweij, and Karen Aardal September 27, 2000



  Home/Search   Context   Related

 
View or download:
cs.uu.nl/research/techr...200022.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cs.uu.nl/research/techreps/...jvl (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We consider the following map labelling problem: given distinct points p the plane, and given #, find a maximum cardinality set of pairwise disjoint axis-parallel # # squares Q 1 , Q 2 , . . . , Q r . This problem reduces to that of finding a maximum cardinality independent set in an associated graph called the conflict graph. We describe several heuristics for the maximum cardinality independent set problem, some of which use an LP solution as input. Also, we describe a... (Update)

Similar documents (at the sentence level):
77.0%:   Algorithms for Maximum Independent Set Applied to Map.. - Strijk, Verweij, Aardal (2000)   (Correct)

Active bibliography (related documents):   More   All
1.1:   An Optimisation Algorithm for Maximum Independent Set with.. - Verweij, Aardal (1999)   (Correct)
0.6:   The Merchant Subtour Problem - Bram Verweij And (2000)   (Correct)
0.6:   Using Genetic Algorithms for Solving Hard Problems in GIS - van Dijk, Thierens, de Berg (2000)   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@techreport{ strijk00algorithms,
    author = "Tycho Strijk and Bram Verweij and Karen Aardal",
    title = "Algorithms for Maximum Independent Set Applied to Map Labelling",
    number = "UU-CS-2000-22",
    year = "2000",
    url = "citeseer.ist.psu.edu/755911.html" }
Citations (may not include all citations):
1527   Optimization by simulated annealing - Kirkpatrick, Gelatt et al. - 1983
354   A note on two problems in connexion with graphs (context) - Dijkstra - 1959
333   Geometric Algorithms and Combinatorial Optimization (context) - Grotschel, Lovasz et al. - 1988
105   A branch-and-cut algorithm for the resolution of largescale .. (context) - Padberg, Rinaldi - 1991
86   Integer Programming (context) - Wolsey - 1998
82   Treewidth: Algorithmic techniques and results - Bodlaender - 1997
79   Solving large-scale zero-one linear programming problems (context) - Crowder, Johnson et al. - 1983
71   Vertex packings: Structural properties and algorithms (context) - Nemhauser, Trotter - 1975
61   An empirical study of algorithms for pointfeature label plac.. - Christensen, Marks et al. - 1995
57   A packing problem with applications to lettering of maps (context) - Formann, Wagner - 1991
46   the facial structure of set packing polyhedra (context) - Padberg - 1973
43   Positioning names on maps (context) - Imhof - 1975
27   Label placement by maximum independent set in rectangles - Agarwal, van Kreveld et al. - 1998
25   The logic of automated map lettering (context) - Yoeli - 1972
22   Properties of vertex packing and independence system polyhed.. (context) - Nemhauser, Trotter - 1974
22   The solution of large 0-1 integer programming problems encou.. (context) - Zoraster - 1990
19   Special facilities in a general mathematical programming sys.. (context) - Beale, Tomlin - 1970
18   Facets and strong valid inequalities for integer programs (context) - Wolsey - 1975
17   Faces for a linear inequality in 0-1 variables (context) - Wolsey - 1975
16   A computational study of search strategies for mixed integer.. - Linderoth, Savelsbergh - 1999
16   Integer programming applied to the map label placement probl.. (context) - Zoraster - 1986
16   the separation of maximally violated mod-k cuts - Caprara, Fischetti et al. - 1999
16   the separation of maximally violated mod-k cuts - Caprara, Fischetti et al. - 2000
15   Finding the connected components and a maximum clique of an .. (context) - Imai, Asano - 1983
15   Tabu search (context) - Hertz, Taillard et al. - 1997
14   Linear Programming (context) - Dantzig, Thapa - 1997
9   Point labeling with sliding labels (context) - van Kreveld, Strijk et al. - 1999
7   An optimisation algorithm for maximum independent set with a.. - Verweij, Aardal - 1999
6   Intersection properties of boxes in R d (context) - Danzer, Grunbaum - 1982
6   New algorithms for two-label point labeling - Qin, Wol et al. - 2000
6   Placing text labels on maps and diagrams - Christensen, Marks et al. - 1994
6   Exact algorithms for a geometric packing problem (context) - Kucera, Mehlhorn et al. - 1993
5   Optimal labelling of point features in the slider model (context) - Klau, Mutzel - 2000
5   Robust genetic algorithms for high quality map labeling - van Dijk, Thierens et al. - 1998
5   Selected Applications of Integer Programming: A Computationa.. (context) - Verweij - 2000
5   Algorithms for Graphs of Small Treewidth (context) - de Fluiter - 1997
5   A unified approach to labeling graphical features - Kakoulis, Tollis - 1998
4   the design of genetic algorithms for geographical applicatio.. - van Dijk, Thierens et al. - 1999
4   strong cutting planebranch and bound algorithm node packing (context) - Sigismondi, plane et al. - 1992
4   Map labeling with application to graph labeling (context) - Neyer - 2000
4   Three rules su#ce for good label placement - Wagner, Wol et al. - 2000
3   An LP relaxation procedure for annotating point features usi.. (context) - Cromley - 1985
3   ective approximation algorithm for the map labeling problem (context) - Wagner, Wol et al. - 1995
2   A technique for finding stable sets in large graphs with tab.. (context) - Friden, Hertz et al. - 1989
2   Routing trains through a railway station based on a node pac.. (context) - Zwaneveld, Kroon et al. - 1997

Documents on the same site (http://www.cs.uu.nl/research/techreps/grp/jvl.html):   More
Comparing Loop Cutsets and Clique Trees in Probabilistic.. - van der Gaag, Bodlaender (1997)   (Correct)
Convex Recoloring of Leaf-Colored Trees - Bachoore, Bodlaender (2006)   (Correct)
Linear Election for Oriented Hypercubes - Gerard Tel Department (1993)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC