|
Numerous practical problems are integer optimization problems that are intractable. Such problems are commonly addressed with heuristics that provide a solution, but not information on the ... ; Approximation Algorithms for NP-Hard Problems; Edited by Dorit S. Hochbaum; Address: Department of Industrial Engineering ;
|
www.ieor.berkeley.edu/~hochbaum/html/book-aanp.html
www.ieor.berkeley.edu/~hochbaum/html/book-aanp.html
|
|
|
List of NP-complete problems - Wikipedia, the free encyclopedia
Here are some of the more commonly known problems that are NP-complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP-complete problems). ...
en.wikipedia.org/wiki/List_of_NP-complete_problems
|
|
there are several so-called NP-hard problems, which most people believe cannot be solved in polynomial time, even though nobody can prove a super-polynomial lower bound. Circuit satisfiability is a good example of a problem that we don't know how to solve in polynomial time.
|
compgeom.cs.uiuc.edu/~jeffe/teaching/algorithms/notes/2...
compgeom.cs.uiuc.edu/~jeffe/teaching/algorithms/notes/21-nphard.pdf
|
|
|
|
Examples of NP-hard problems include the traveling salesman problem and the popular game Tetris. Related category; • COMPUTERS, ARTIFICIAL INTELLIGENCE, AND CYBERNETICS;
|
www.daviddarling.info/encyclopedia/N/NP-hard_problem.ht...
www.daviddarling.info/encyclopedia/N/NP-hard_problem.html
|
|
|
This is a continuously updated catalog of approximability results for NP optimization problems. The compendium is also a part of the book Complexity and Approximation. The compendium has not been updated for a while, so there might exist recent results that are not mentioned in the compendium.
|
www.nada.kth.se/~viggo/problemlist/compendium.html
www.nada.kth.se/~viggo/problemlist/compendium.html
|
|
DIMACS Workshop on Faster Exact Solutions for NP-Hard Problems ... When: 9am February 23 - Noon February 24, 2000 ... Where: The Nassau Inn in Princeton, New Jersey...
|
www.cis.temple.edu/~beigel/FESNP/
www.cis.temple.edu/~beigel/FESNP/
|
|
February 23 - 24, 2000; The Nassau Inn, Princeton, NJ ... Organizers: Mohan Paturi, University of California - San Diego, paturi@cs.ucsd.edu Richard Beigel, University of Illinois at Chicago, beigel@uic.edu Presented under the auspices of the Special Year on Computational Intractability. ... There is a $40/day registration fee,
|
dimacs.rutgers.edu/Workshops/Faster/
|
|
Experimentation also brings algorithmic questions closer to the original problems that motivated theoretical work. It also tests many assumptions about implementation methods and data structures. ... NP Hard Problems: Maximum Clique, Graph Coloring, and Satisfiability...
|
dimacs.rutgers.edu/Challenges/
|
|
Based on the framework of parameterized complexity theory,we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. ... TI - Tight Lower Bounds for Certain Parameterized NP-Hard Problems; SN - 1093-0159; SP150; EP160; A1 - Jianer Chen, A1 - Benny Chor,
|
csdl.computer.org/comp/proceedings/ccc/2004/2120/00/212...
csdl.computer.org/comp/proceedings/ccc/2004/2120/00/21200150abs.htm
|
|
