1.5-Approximation for treewidth of graphs excluding a graph with one crossing as a minor

Erik D. Demaine, MohammadTaghi Hajiaghayi, and Dimitrios M. Thilikos
Proc. 5th Int. Worksh. Approximation Algorithms for Combinatorial Optimization (APPROX 2002), Lecture Notes in Computer Science 2462, Klaus Jansen, Stefano Leonardi, and Vijay V. Vazirani, ed., Springer-Verlag, 2002, pp. 67–80
http://www.lsi.upc.es/~sedthilk/papers/single.pdf

Cites:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!