NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
711	How to find the best approximation results – a follow-up to Garey and Johnson∗ Pierluigi Crescenzi† Viggo Kann‡ Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 1998-12-21 18:16:27 Complexity classes Mathematical optimization NP-complete problems Combinatorial optimization Approximation algorithm NP-complete Hardness of approximation Optimization problem Reduction Theoretical computer science Computational complexity theory Applied mathematics
712	doi:j.ipl Add to Reading List Source URL: www.cc.ntut.edu.tw Language: English - Date: 2008-03-02 23:12:13 Automated theorem proving NP-complete problems Unit propagation 2-satisfiability Time complexity Variable MAX-3SAT (SAT ε-UNSAT) Theoretical computer science Mathematics Computational complexity theory
713	Spanners and Sparsifiers in Dynamic Streams Michael Kapralov∗ MIT ABSTRACT Linear sketching is a popular technique for computing in dynamic Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:51 Combinatorial optimization Spanning tree NP-complete problems Algebraic graph theory Probabilistic complexity theory Randomized algorithm Connectivity Minimum spanning tree Graph partition Mathematics Theoretical computer science Graph theory
714	Confluence in Data Reduction: Bridging Graph Transformation and Kernelization∗ Hartmut Ehrig Claudia Ermel Falk H¨ uffner† Add to Reading List Source URL: www.user.tu-berlin.de Language: English - Date: 2013-01-21 07:14:53 NP-complete problems Analysis of algorithms Parameterized complexity Graph operations Kernelization Clique Intersection number Graph Path decomposition Graph theory Theoretical computer science Mathematics
715	Optim Lett:287–295 DOIs11590ORIGINAL PAPER A generalization of the Motzkin–Straus theorem to hypergraphs Add to Reading List Source URL: www.dsi.unive.it Language: English - Date: 2010-08-27 12:14:22 Clique Extremal graph theory Hypergraph Degree Line graph Graph structure theorem Graph theory NP-complete problems Graph operations
716	Mungo’s Crossword N023 Add to Reading List Source URL: www.echo.net.au Language: English - Date: 2014-06-16 21:54:27 Crosswords NP-complete problems Cryptic crossword
717	Lift-and-Project Integrality Gaps for the Traveling Salesperson Problem Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2014-04-18 21:30:54 NP-complete problems Operations research Combinatorial optimization Linear programming Travelling salesman problem Linear programming relaxation Relaxation Graph Shortest path problem Theoretical computer science Mathematics Graph theory
718	Incremental List Coloring of Graphs, Parameterized by ConservationI Sepp Hartunga , Rolf Niedermeiera a Institut f¨ Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-01-22 17:08:40 Graph coloring NP-complete problems List coloring Parameterized complexity Kernelization Vertex cover Independent set Edge coloring Complete coloring Graph theory Theoretical computer science Mathematics
719	Constant Thresholds Can Make Target Set Selection Tractable? Morgan Chopin1?? , Andr´e Nichterlein2 , Rolf Niedermeier2 , and Mathias Weller2? ? ? 1 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-09-21 09:31:02 Graph operations Path decomposition Clique Kernelization Vertex cover Parameterized complexity Tree decomposition Feedback vertex set Dominating set Graph theory Theoretical computer science NP-complete problems
720	Irene Moulitsas and George Karypis University of Minnesota, Department of Computer Science / Army HPC Research Center Minneapolis, MN 55455 moulitsa, karypis @cs.umn.edu Add to Reading List Source URL: www-users.cs.umn.edu Language: English - Date: 2001-12-10 13:46:18 Mesh generation NP-complete problems Multigrid method Numerical analysis Wavelets Graph partition Unstructured grid Regular grid Biconnected component Mathematics Theoretical computer science Graph theory

UPDATE