On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods
- 4 November 2014
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 56 (1) , 220-250
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- An efficient algorithm for relay placement in a ring sensor networksExpert Systems with Applications, 2009
- The projection median of a set of pointsComputational Geometry, 2009
- Largest and Smallest Convex Hulls for Imprecise PointsAlgorithmica, 2008
- TSP with neighborhoods of varying sizeJournal of Algorithms, 2005
- Systems of distant representativesDiscrete Applied Mathematics, 2005
- Approximation algorithms for TSP with neighborhoods in the planeJournal of Algorithms, 2003
- n-Ellipses and the Minimum Distance Sum ProblemThe American Mathematical Monthly, 1999
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problemsJournal of the ACM, 1998
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fieldsJournal of the ACM, 1995
- Weighted k‐cardinality trees: Complexity and polyhedral structureNetworks, 1994