Sciweavers

Share
SODA
2008
ACM
93views Algorithms» more  SODA 2008»
9 years 1 months ago
Minimum weight convex Steiner partitions
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
Adrian Dumitrescu, Csaba D. Tóth
books