Back to Results
First PageMeta Content
Operations research / Spanning tree / Complexity classes / NP-complete problems / Minimum spanning tree / Steiner tree problem / R-tree / Approximation algorithm / Facility location / Theoretical computer science / Computational complexity theory / Applied mathematics


CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximating k-hop Minimum Spanning Trees in Euclidean Metrics∗ S¨oren Laue† Abstract
Add to Reading List

Document Date: 2008-10-28 21:25:19

Open Document

File Size: 64,79 KB

Share Result on Facebook
UPDATE