论文信息 - On Radiocoloring Hierarchically Speci(cid:12)ed Planar Graphs: PSPACE -completeness and Approximations - 字舞流文

On Radiocoloring Hierarchically Speci(cid:12)ed Planar Graphs: PSPACE -completeness and Approximations

.

Paul G. Spirakis | Maria I. Andreou | Sotiris E. Nikoletseas | Dimitris Fotakis | Vicky Papadopoulou Lesta | P. Spirakis | S. Nikoletseas | M. Andreou | Dimitris Fotakis | V. P. Lesta

[1] Xiao Zhou,et al. Generalized Vertex-Colorings of Partial K-Trees , 2000 .

[2] Magnús M. Halldórsson,et al. Coloring powers of planar graphs , 2000, SODA '00.

[3] Harry B. Hunt,et al. Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems , 1998, SIAM J. Comput..

[4] Thomas Lengauer,et al. The Correlation between the Complexities of the Nonhierarchical and Hierarchical Versions of Graph Problems , 1987, J. Comput. Syst. Sci..

[5] Brenda S. Baker,et al. Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[6] S. Thomas McCormick,et al. Optimal approximation of sparse hessians and its equivalence to a graph coloring problem , 1983, Math. Program..

[7] Jan van Leeuwen,et al. Approximations for -Coloring of Graphs , 2004 .

[8] Paul G. Spirakis,et al. NP-ompleteness Results and EÆ ient Approximations for Radio oloring in Planar Graphs , 2000 .

[9] Madhav V. Marathe,et al. Approximation Algorithms for Channel Assignment in Radio Networks , 1998 .

[10] H. Bodlaender. Planar graphs with bounded treewidth , 1988 .