A unified approach to approximation problems for NP- and PSPACE-hard problems for geometric graphs

Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, and Richard E. Stearns
J. Algorithms 26(2):238–274, Feb 1998
Proc. 2nd Eur. Symp. Algorithms (ESA 1994), Lecture Notes in Computer Science 855, Jan van Leeuwen, ed., Springer-Verlag, Sep 1994, pp. 424–435
Tech. report 94-3, State Univ. of New York at Albany, Dept. of Computer Science, 1994

Cites:

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