Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs
- 18 June 2003
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 829-844
- https://doi.org/10.1007/3-540-45061-0_65
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar GraphsAlgorithmica, 2002
- Map graphsJournal of the ACM, 2002
- Deciding first-order properties of locally tree-decomposable structuresJournal of the ACM, 2001
- Approximation Algorithms for Independent Sets in Map GraphsJournal of Algorithms, 2001
- Diameter and Treewidth in Minor-Closed Graph FamiliesAlgorithmica, 2000
- Quickly Excluding a Planar GraphJournal of Combinatorial Theory, Series B, 1994
- Call routing and the ratcatcherCombinatorica, 1994
- Approximation algorithms for NP-complete problems on planar graphsJournal of the ACM, 1994
- How to Allocate Network CentersJournal of Algorithms, 1993
- Clustering to minimize the maximum intercluster distanceTheoretical Computer Science, 1985