Trimming of Graphs, with Application to Point Labeling

For t>0 and g≥0, a vertex-weighted graph of total weight W is (t,g)-trimmable if it contains a vertex-induced subgraph of total weight at least (1−1/t)W and with no simple path of more than g edges. A family of graphs is trimmable if for every constant t>0, there is a constant g≥0 such that every vertex-weighted graph in the family is (t,g)-trimmable. We show that every family of graphs of bounded domino treewidth is trimmable. This implies that every family of graphs of bounded degree is trimmable if the graphs in the family have bounded treewidth or are planar. We also show that every family of directed graphs of bounded layer bandwidth (a less restrictive condition than bounded directed bandwidth) is trimmable. As an application of these results, we derive polynomial-time approximation schemes for various forms of the problem of labeling a subset of given weighted point features with nonoverlapping sliding axes-parallel rectangular labels so as to maximize the total weight of the labeled features, provided that the ratios of label heights or the ratios of label lengths are bounded by a constant. This settles one of the last major open questions in the theory of map labeling.

[1]  Minghui Jiang.  A new approximation algorithm for labeling points with circle pairs , 2006, Inf. Process. Lett..

[2]  Wolfgang Maass,et al.  Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.

[3]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[4]  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).

[5]  Alexander Wolff,et al.  Point labeling with sliding labels , 1999, Comput. Geom..

[6]  Alexander Wolff,et al.  Labeling Points with Weights , 2001, Algorithmica.

[7]  David Haussler,et al.  ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..

[8]  Klaus Jansen,et al.  A New Approximation Algorithm for Labeling Weighted Points with Sliding Labels , 2006 .

[9]  Binhai Zhu,et al.  Polynomial Time Algorithms for Three-Label Point Labeling , 2001, COCOON.

[10]  Alexander Wolff,et al.  New Algorithms for Two-Label Point Labeling , 2000, ESA.

[11]  B. Mohar,et al.  Graph Minors , 2009 .

[12]  David S. Johnson,et al.  COMPLEXITY RESULTS FOR BANDWIDTH MINIMIZATION , 1978 .

[13]  Hans L. Bodlaender,et al.  A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..

[14]  Subhash Suri,et al.  Label placement by maximum independent set in rectangles , 1998, CCCG.

[15]  Bogdan Oporowski,et al.  Some results on tree decomposition of graphs , 1995, J. Graph Theory.

[16]  Hans L. Bodlaender,et al.  A note on domino treewidth , 1999, Discret. Math. Theor. Comput. Sci..