Approximability of the path-distance-width for AT-free graphs

Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki

研究成果: 書籍/レポート タイプへの寄稿会議への寄与

2 被引用数 (Scopus)

抄録

The path-distance-width of a graph measures how close the graph is to a path. We consider the problem of determining the path-distance-width for graphs with chain-like structures such as k-cocomparability graphs, AT-free graphs, and interval graphs. We first show that the problem is NP-hard even for a very restricted subclass of AT-free graphs. Next we present simple approximation algorithms with constant approximation ratios for graphs with chain-like structures. For instance, our algorithm for AT-free graphs has approximation factor 3 and runs in linear time. We also show that the problem is solvable in polynomial time for the class of cochain graphs, which is a subclass of the class of proper interval graphs.

本文言語英語
ホスト出版物のタイトルGraph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Revised Papers
ページ271-282
ページ数12
DOI
出版ステータス出版済み - 2011
イベント37th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2011 - Tepla Monastery, チェコ共和国
継続期間: 6月 21 20116月 24 2011

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
6986 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

その他

その他37th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2011
国/地域チェコ共和国
CityTepla Monastery
Period6/21/116/24/11

!!!All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Approximability of the path-distance-width for AT-free graphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル