• Corpus ID: 297554

A Bound on the Expected Optimality of Random Feasible Solutions to Combinatorial Optimization Problems

@article{Sultanik2014ABO,
  title={A Bound on the Expected Optimality of Random Feasible Solutions to Combinatorial Optimization Problems},
  author={Evan A. Sultanik},
  journal={ArXiv},
  year={2014},
  volume={abs/1402.0423}
}
  • E. Sultanik
  • Published 3 February 2014
  • Computer Science, Mathematics
  • ArXiv
This paper investigates and bounds the expected solution quality of combinatorial optimization problems when feasible solutions are chosen at random. Loose general bounds are discovered, as well as families of combinatorial optimization problems for which random feasible solutions are expected to be a constant factor of optimal. One implication of this result is that, for graphical problems, if the average edge weight in a feasible solution is sufficiently small, then any randomly chosen… 

Figures from this paper

References

SHOWING 1-3 OF 3 REFERENCES

Improved approximation algorithms for network design problems

This paper presents an approximation algorithm with a performance guarantee of 2TH(fmax) = 2(1 + $ + g +) where fmax is the maximum requirement, and improves upon the best previously known performance guarantees of 2fmax.

A scaling technique for better network design

The main contribution of this paper is a scaling technique that allows us to make an approximation guarantee that is independent of the requirements; the authors obtain a 2’H(A 1) approximation factor for the uncapacitated generalized Steiner network problem.

Bounds on expectations of order statistics via extremal dependences