NP-hard problems - PDFSEARCH.IO - Document Search Engine

NP-hard problems
Results: 67

#	Item
61	Approximating NP-hard Problems Efficient Algorithms and their Limits Prasad Raghavendra A dissertation submitted in partial fulfillment Add to Reading List Source URL: www.eecs.berkeley.edu Language: English - Date: 2009-10-30 11:58:51 Mathematical optimization Linear programming Computational complexity theory Combinatorial optimization Operations research Semidefinite programming Linear programming relaxation Relaxation Constraint satisfaction problem Theoretical computer science Mathematics Applied mathematics
62	Some practical experiences of hard graph problems Keith Briggs [removed] Add to Reading List Source URL: keithbriggs.info Language: English - Date: 2006-06-08 04:34:22 Graph coloring Clique Independent set Fractional coloring Clique problem Graph theory Theoretical computer science NP-complete problems
63	A Survey of 3sum-Hard Problems James King [removed] Add to Reading List Source URL: www.cs.mcgill.ca Language: English - Date: 2004-12-20 06:07:32 3SUM Computational geometry NP-complete problems Analysis of algorithms Time complexity Reduction Algorithm Boolean satisfiability problem Complexity class Theoretical computer science Applied mathematics Computational complexity theory
64	Technical Report CS2008[removed]Department of Computer Science and Engineering Add to Reading List Source URL: charlotte.ucsd.edu Language: English - Date: 2008-01-23 16:06:35 Differential geometry MAXEkSAT Constructible universe NP-hard problems NP-complete problems
65	Improved Steiner Tree Approximation in Graphs Gabriel Robinsy and Alexander Zelikovskyz y Add to Reading List Source URL: www.cs.virginia.edu Language: English - Date: 1999-10-25 15:38:00 Spanning tree NP-complete problems Steiner tree problem NP-hard problems Quasi-bipartite graph Minimum spanning tree Rectilinear Steiner tree Vertex cover Matching Graph theory Theoretical computer science Mathematics
66	PDF Document Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2007-09-01 17:32:46 Complexity classes NP-complete problems Approximation algorithms Mathematical optimization NP-complete NP-hard Optimization problem APX P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics
67	PDF Document Add to Reading List Source URL: www.csc.kth.se Language: English - Date: 2007-09-01 17:32:46 Complexity classes NP-complete problems Approximation algorithms Mathematical optimization NP-complete NP-hard Optimization problem APX P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics

UPDATE