Random restricted matching and lower bounds for combinatorial optimization

Authors:
Stefan Steinerberger
Affiliations:
Mathematical Institute, University of Bonn, Bonn, Germany 53115
Venue:
Journal of Combinatorial Optimization
Year:
2012

Citing 3
Cited 0

Box integrals

Journal of Computational and Applied Mathematics
A First Course in Order Statistics (Classics in Applied Mathematics)

A First Course in Order Statistics (Classics in Applied Mathematics)
A new lower bound for the geometric traveling salesman problem in terms of discrepancy

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

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.