Random restricted matching and lower bounds for combinatorial optimization

Stefan Steinerberger ()
Additional contact information
Stefan Steinerberger: University of Bonn

Journal of Combinatorial Optimization, 2012, vol. 24, issue 3, No 9, 280-298

Abstract: Abstract We prove results on optimal random extensions of trees over points in [0,1] d . As an application, we give a general framework for translating results from combinatorial optimization about the behaviour of random points into results for point sets with sufficiently high regularity. We furthermore introduce a new irregularity problem concerning Voronoi cells, which has applications in logistics.

Keywords: Traveling salesman; Minimal spanning tree; Voronoi decomposition; Restricted matching; Packing problems; Uniform distribution (search for similar items in EconPapers)
Date: 2012
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-011-9384-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:24:y:2012:i:3:d:10.1007_s10878-011-9384-4

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-011-9384-4

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().