F. Wagner and A. Wol#. An e#cient and e#ective approximation algorithm for the map labeling problem. In P. Spirakis, editor, Algorithms --- ESA '95, Proceedings of the Third Annual European Symposium, volume 979 of Lecture Notes in Computer Science, pages 420--433. Springer-Verlag, Berlin, 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Algorithms for Maximum Independent Set Applied to Map.. - Strijk, Verweij, Aardal (2000) (Correct)
....one wants to produce a map that is going to be printed it can be well worth the e#ort to try and find an optimal labelling. Christensen, Marks, and Shieber [7, p. 219] reported that optimising is impractical for map labelling instances with more than 50 cities. In the same year, Wagner and Wolf [37] 1 mentioned that they were able to solve instances with up to 300 cities to optimality. Verweij and Aardal [36] were the first to show that it is computationally feasible to compute provably optimal labellings for maps with up to 800 cities. In this paper we address both heuristic algorithms ....
....di#erent values of #. So, the basic map labelling problem reduces to the decision variant. Kucera et al. also present an exponentialtime algorithm that solves the decision variant of the map labelling problem to optimality. They do not, however, report on computational experiments. Wagner and Wolf [37] mention that they were able to use the algorithm proposed by Kucera et al. to solve problems with up to 300 cities to optimality. Another variant of the map labelling problem, which we will refer to as the optimisation variant, has the label size # as input, and asks for as many pairwise disjoint ....
[Article contains additional citation context not shown here]
F. Wagner and A. Wol#. An e#cient and e#ective approximation algorithm for the map labeling problem. In P. Spirakis, editor, Algorithms --- ESA '95, Proceedings of the Third Annual European Symposium, volume 979 of Lecture Notes in Computer Science, pages 420--433. Springer-Verlag, Berlin, 1995.
An Optimisation Algorithm for Maximum Independent Set with.. - Verweij, Aardal (1999) (5 citations) (Correct)
....we want to solve ODP to optimality, unless P = NP . Formann and Wagner [13] developed a 1 2 approximation algorithm for ODP. Di erent heuristic algorithms (including simulated annealing) are discussed by Christensen et al. 8] Van Dijk et al. 10] considered genetic algorithms, Wagner and Wol [26] propose a hybrid heuristic. Cromly [9] proposed a semi automatic LP based approach for nding feasible solutions to ODP. Zoraster [29, 30] used Lagrangean relaxation to make a heuristic algorithm for ODP. We formulate ODP as an independent set problem, see Section 1.1 and develop a branch and cut ....
F. Wagner and A. Wol . An ecient and e ective 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.
Algorithms for Maximum Independent Set Applied to Map - Tycho Strijk Bram (2000) (Correct)
No context found.
F. Wagner and A. Wol#. An e#cient and e#ective approximation algorithm for the map labeling problem. In P. Spirakis, editor, Algorithms --- ESA '95, Proceedings of the Third Annual European Symposium, volume 979 of Lecture Notes in Computer Science, pages 420--433. Springer-Verlag, Berlin, 1995.
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