Bidimensionality: new connections between FPT algorithms and PTASs

@inproceedings{Demaine2005BidimensionalityNC,
  title={Bidimensionality: new connections between FPT algorithms and PTASs},
  author={Erik D. Demaine and Mohammad Taghi Hajiaghayi},
  booktitle={SODA},
  year={2005}
}
We demonstrate a new connection between fixed-parameter tractability and approximation algorithms for combinatorial optimization problems on planar graphs and their generalizations. Specifically, we extend the theory of so-called "bidimensional" problems to show that essentially all such problems have both subexponential fixed-parameter algorithms and PTASs. Bidimensional problems include e.g. feedback vertex set, vertex cover, minimum maximal matching, face cover, a series of vertex-removal… CONTINUE READING
Highly Influential
This paper has highly influenced 12 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 93 extracted citations

References

Publications referenced by this paper.
Showing 1-3 of 3 references

AND m

  • S. ARORA, M. GRIGNI, D. KARGER, P. KLEIN
  • WOLOSZYN, A polynomial-time approximation scheme…
  • 1998
Highly Influential
6 Excerpts

Approximation algorithms for NP-complete problems on planar graphs

  • B. S. BAKER
  • Journal of the Association for Computing…
  • 1994
Highly Influential
20 Excerpts

Similar Papers

Loading similar papers…