首页    期刊浏览 2024年11月24日 星期日
登录注册

文章基本信息

  • 标题:Trimming of Graphs, with Application to Point Labeling
  • 本地全文:下载
  • 作者:Thomas Erlebach ; Torben Hagerup ; Klaus Jansen
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2008
  • 卷号:1
  • 页码:265-276
  • DOI:10.4230/LIPIcs.STACS.2008.1350
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要: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.
  • 关键词:Trimming weighted graphs; domino treewidth; planar graphs; point-feature label placement; map labeling; polynomial-time approximation schemes
国家哲学社会科学文献中心版权所有