Smoothed Performance Guarantees for Local Search

Details Smoothed Performance Guarantees for Local Search Smoothed Performance Guarantees for Local Search

2011-05-13

arxiv.org/abs/1105.2686v1

Computer Science

Data Structures and Algorithms

Scientific paper

We study popular local search and greedy algorithms for scheduling. The performance guarantee of these algorithms is well understood, but the worst-case lower bounds seem somewhat contrived and it is questionable if they arise in practical applications. To find out how robust these bounds are, we study the algorithms in the framework of smoothed analysis, in which instances are subject to some degree of random noise. While the lower bounds for all scheduling variants with restricted machines are rather robust, we find out that the bounds are fragile for unrestricted machines. In particular, we show that the smoothed performance guarantee of the jump and the lex-jump algorithm are (in contrast to the worst case) independent of the number of machines. They are Theta(phi) and Theta(log(phi)), respectively, where 1/phi is a parameter measuring the magnitude of the perturbation. The latter immediately implies that also the smoothed price of anarchy is Theta(log(phi)) for routing games on parallel links. Additionally we show that for unrestricted machines also the greedy list scheduling algorithm has an approximation guarantee of Theta(log(phi)).

Affiliated with

Also associated with

No associations

Rating

Smoothed Performance Guarantees for Local Search does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Smoothed Performance Guarantees for Local Search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Smoothed Performance Guarantees for Local Search will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-27133