Are stable instances easy?

Details Are stable instances easy? Are stable instances easy?

2009-06-17

arxiv.org/abs/0906.3162v1

Computer Science

Computational Complexity

14 pages

Scientific paper

We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. The question then arises whether stable instances of NP--hard problems are easier to solve. In particular, whether there exist algorithms that solve correctly and in polynomial time all sufficiently stable instances of some NP--hard problem. The paper focuses on the Max--Cut problem, for which we show that this is indeed the case.

Affiliated with

Also associated with

No associations

Rating

Are stable instances easy? 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 Are stable instances easy?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Are stable instances easy? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-223160