• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 9,518
Next 10 →

The approximability of NP-hard problems

by Sanjeev Arora - In Proceedings of the Annual ACM Symposium on Theory of Computing , 1998
"... Many problems in combinatorial optimization are NP-hard (see [60]). This has forced researchers to explore techniques for dealing with NP-completeness. Some have considered algorithms that solve “typical” ..."
Abstract - Cited by 17 (0 self) - Add to MetaCart
Many problems in combinatorial optimization are NP-hard (see [60]). This has forced researchers to explore techniques for dealing with NP-completeness. Some have considered algorithms that solve “typical”

NP-hard problems

by Roman V. Yampolskiy, Ahmed El-barkouky
"... Wisdom of artificial crowds algorithm for solving ..."
Abstract - Add to MetaCart
Wisdom of artificial crowds algorithm for solving

Local Search for NP-Hard Problems

by Jeremy David Frank , 1997
"... To date, computer scientists believe that NP-Hard 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 NP-Hard 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 NP-hard Problems

by Yi Wu , 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 NP-hard 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 NP-hard optimization problem, what is the best approximation guarantee that any polynomial time algorithm could

Exact Algorithms for NP-Hard Problems

by Gerhard J. Woeginger - Lecture Notes in Computer Science, SpringerVerlag Heidelberg, Volume 2570 , 2003
"... A survey ..."
Abstract - Cited by 12 (0 self) - Add to MetaCart
Abstract not found

The Fault Tolerance of NP-Hard Problems

by Christian Glaßer, A. Pavan, Stephen Travers
"... Abstract. We study the effects of faulty data on NP-hard 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 NP-hard 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 NP-Hard Problems

by Ravi Kannan, Marek Karpinski , Hans Jürgen Prömel - MATHEMATISCHES FORSCHUNGSINSTITUT OBERWOLFACH REPORT NO. 28/2004 , 2004
"... ..."
Abstract - Add to MetaCart
Abstract not found

Approximation Algorithms for NP-Hard Problems

by Ravi Kannan , Marek Karpinski , Hans Jürgen Prömel - MATHEMATISCHES FORSCHUNGSINSTITUT OBERWOLFACH REPORT NO. 28/2004 , 2004
"... ..."
Abstract - Add to MetaCart
Abstract not found

Rigorous analysis of heuristics for NP-hard problems

by Uriel Feige - In Proceedings of the 16 th annual ACM-SIAM Symposium on Discrete Algorithms , 2005
"... The known NP-hardness 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 NP-hard problem is a polynomial time algorithm that produces optimal or near o ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
The known NP-hardness 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 NP-hard problem is a polynomial time algorithm that produces optimal or near

Test Instance Construction for NP-hard Problems

by Laura A. Sanchis , 1987
"... The performance of heuristic approximation algorithms for NP-hard 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 NP-hard 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
Next 10 →
Results 1 - 10 of 9,518
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University