Approximability of the Path-Distance-Width for AT-free Graphs
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.
KeywordsBipartite Graph Linear Time Approximation Ratio Interval Graph Graph Class
Unable to display preview. Download preview PDF.
- 1.Blache, G., Karpinski, M., Wirtgen, J.: On approximation intractability of the bandwidth problem, ECCC TR98-014 (1998)Google Scholar
- 2.Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM (1999)Google Scholar
- 7.Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman (1979)Google Scholar
- 14.Kobayashi, Y.: Private communication (September 2010)Google Scholar