Results 1  10
of
9,518
The approximability of NPhard problems
 In Proceedings of the Annual ACM Symposium on Theory of Computing
, 1998
"... Many problems in combinatorial optimization are NPhard (see [60]). This has forced researchers to explore techniques for dealing with NPcompleteness. Some have considered algorithms that solve “typical” ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
Many problems in combinatorial optimization are NPhard (see [60]). This has forced researchers to explore techniques for dealing with NPcompleteness. Some have considered algorithms that solve “typical”
Local Search for NPHard Problems
, 1997
"... To date, computer scientists believe that NPHard problems cannot be solved by algorithms which run in less than exponential time in the worst case. One way to approach these problems is to design algorithms that do not guarantee a solution to every problem instance, but which solve many if not mo ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
To date, computer scientists believe that NPHard problems cannot be solved by algorithms which run in less than exponential time in the worst case. One way to approach these problems is to design algorithms that do not guarantee a solution to every problem instance, but which solve many
The Approximability of Some NPhard Problems
, 2009
"... An αapproximation algorithm is an algorithm guaranteed to output a solution that is within an α ratio of the optimal solution. We are interested in the following question: Given an NPhard optimization problem, what is the best approximation guarantee that any polynomial time algorithm could achiev ..."
Abstract
 Add to MetaCart
An αapproximation algorithm is an algorithm guaranteed to output a solution that is within an α ratio of the optimal solution. We are interested in the following question: Given an NPhard optimization problem, what is the best approximation guarantee that any polynomial time algorithm could
Exact Algorithms for NPHard Problems
 Lecture Notes in Computer Science, SpringerVerlag Heidelberg, Volume 2570
, 2003
"... A survey ..."
The Fault Tolerance of NPHard Problems
"... Abstract. We study the effects of faulty data on NPhard sets. We consider hard sets for several polynomial time reductions, add corrupt data and then analyze whether the resulting sets are still hard for NP. We explain that our results are related to a weakened deterministic variant of the notion o ..."
Abstract
 Add to MetaCart
Abstract. We study the effects of faulty data on NPhard sets. We consider hard sets for several polynomial time reductions, add corrupt data and then analyze whether the resulting sets are still hard for NP. We explain that our results are related to a weakened deterministic variant of the notion
Approximation Algorithms for NPHard Problems
 MATHEMATISCHES FORSCHUNGSINSTITUT OBERWOLFACH REPORT NO. 28/2004
, 2004
"... ..."
Approximation Algorithms for NPHard Problems
 MATHEMATISCHES FORSCHUNGSINSTITUT OBERWOLFACH REPORT NO. 28/2004
, 2004
"... ..."
Rigorous analysis of heuristics for NPhard problems
 In Proceedings of the 16 th annual ACMSIAM Symposium on Discrete Algorithms
, 2005
"... The known NPhardness results imply that for many combinatorial optimization problems there are no efficient algorithms that find an optimal solution, or even a near optimal solution, on every instance. A heuristic for an NPhard problem is a polynomial time algorithm that produces optimal or near o ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The known NPhardness results imply that for many combinatorial optimization problems there are no efficient algorithms that find an optimal solution, or even a near optimal solution, on every instance. A heuristic for an NPhard problem is a polynomial time algorithm that produces optimal or near
Test Instance Construction for NPhard Problems
, 1987
"... The performance of heuristic approximation algorithms for NPhard problems can often only be determined by experimentation. This paper explores some of the issues involved in the efficient generation of useful test sets for such problems, i.e. test sets consisting of instances of the problem for whi ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The performance of heuristic approximation algorithms for NPhard problems can often only be determined by experimentation. This paper explores some of the issues involved in the efficient generation of useful test sets for such problems, i.e. test sets consisting of instances of the problem
Results 1  10
of
9,518