David D. Eisenstat

1. An efficient polynomial-time approximation scheme for Steiner forest in planar graphs
   2011/10/06 by David D. Eisenstat, Eisenstat, David, Philip Α. Klein +3 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences