A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
A Note on Approximating Weighted Independence on Intersection Graphs of Paths on a Grid
[article]
2018
arXiv
pre-print
A graph G is called B_k-VPG, for some constant k≥ 0, if it has a string representation on an axis-parallel grid such that each vertex is a path with at most k bends and two vertices are adjacent in G if and only if the corresponding paths intersect each other. The part of a path that is between two consecutive bends is called a segment of the path. In this paper, we study the Maximum-Weighted Independent Set problem on B_k-VPG graphs. The problem is known to be NP-complete on B_1-VPG graphs,
arXiv:1708.09314v2
fatcat:mlttduwv7bairo6c5tga7pj3sm