P. Widmayer
- A faster approximation algorithm for the Steiner problem in graphs
1986/05/01 by Y. F. Wu, Peter Widmayer, P. Widmayer +2 · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Algorithm #Approximation algorithm #Binary tree #Combinatorics #Complexity and Algorithms in Graphs #Connected dominating set #Discrete mathematics #Gomory–Hu tree #Graph #Graph power #K-ary tree #Line graph #Mathematics #Spanning tree #Steiner tree problem #Theory of computation #Tree structure #Undirected graph #VLSI and FPGA Design Techniques #Wheel graph #k-minimum spanning tree
- Inapproximability Results for Guarding Polygons and Terrains
2001/09/01 by S. Eidenbenz, Stephan Eidenbenz, Christoph Stamm +3 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Approximation algorithm #Binary logarithm #Combinatorics #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Computer science #Discrete mathematics #Geometry #Graph #Guard (computer science) #Mathematics #Point in polygon #Polygon (computer graphics) #Regular polygon #Set (abstract data type) #Set cover problem #Simple polygon #Time complexity #Vertex (graph theory) #Vertex cover