Approximation Algorithms for Independent Sets in Map Graphs
Author:
- Zhi-Zhong ChenZCZhi-Zhong Chen
- 1 October 2001
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 41 (1) , 20-40
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- A unified approach to approximating resource allocation and scheduling2000
- Efficient Approximation Schemes for Maximization Problems onK3,3-free orK5-free GraphsJournal of Algorithms, 1998
- Planar map graphs1998
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small TreewidthSIAM Journal on Computing, 1996
- Approximation algorithms for NP-complete problems on planar graphsJournal of the ACM, 1994
- Cyclic coloring of plane graphsDiscrete Mathematics, 1992
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- Finding small simple cycle separators for 2-connected planar graphsJournal of Computer and System Sciences, 1986
- Applications of a Planar Separator TheoremSIAM Journal on Computing, 1980
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979