Combinational optimization problems for which almost every algorithm is asymptotically optimal
Author:
- W. SzpankowskiWSW. Szpankowski
- 1 January 1995
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 33 (4) , 359-367
Abstract
Consider a class of optimization problems for which the cardinality of the set of feasible solutions is m and the size of every feasible solution is N. We prove in a general probabilistic framework that the value of the optimal solution and the value of the worst solution are asymptotically almost surely (a.s.) the same provided as N and m become large. This result implies that for such a class of combinatorial optimization problems almost ecery algorithm finds asymptotically optimal solution! The quadratic assignment problem, a location problem on graphs, and a pattern matching problem fall into this classKeywords
This publication has 12 references indexed in Scilit:
- A probabilistic analysis of a pattern matching problemRandom Structures & Algorithms, 1993
- Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion RevisitedSIAM Journal on Computing, 1992
- The Erdos-Renyi Law in Distribution, for Coin Tossing and Sequence MatchingThe Annals of Statistics, 1990
- A note on asymptotic properties of the quadratic assignment problemOperations Research Letters, 1988
- On linear programs with random costsMathematical Programming, 1986
- Probabilistic asymptotic properties of some combinatorial optimization problemsDiscrete Applied Mathematics, 1985
- Asymptotic Properties of the Quadratic Assignment ProblemMathematics of Operations Research, 1985
- Worst-Case and Probabilistic Analysis of a Geometric Location ProblemSIAM Journal on Computing, 1981
- Optimization Problems on Graphs with Independent Random Edge WeightsSIAM Journal on Computing, 1981
- Random Graphs and Graph Optimization ProblemsSIAM Journal on Computing, 1980