Trimming of Graphs, with Application to Point Labeling

Details Trimming of Graphs, with Application to Point Labeling Trimming of Graphs, with Application to Point Labeling

2008-02-20

arxiv.org/abs/0802.2854v1

Dans Proceedings of the 25th Annual Symposium on the Theoretical Aspects of Computer Science - STACS 2008, Bordeaux : France (

Computer Science

Discrete Mathematics

Scientific paper

For $t,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 each constant $t>0$, there is a constant $g=g(t)$ 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. Based on this result, we derive a polynomial-time approximation scheme for the problem of labeling weighted points with nonoverlapping sliding labels of unit height and given lengths so as to maximize the total weight of the labeled points. This settles one of the last major open questions in the theory of map labeling.

Affiliated with

Also associated with

No associations

Rating

Trimming of Graphs, with Application to Point Labeling does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Trimming of Graphs, with Application to Point Labeling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Trimming of Graphs, with Application to Point Labeling will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-647835