NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
211	Economics and Computation ECONand CPSCProfessor Dirk Bergemann and Professor Joan Feigenbaum Lecture IV Add to Reading List Source URL: zoo.cs.yale.edu Language: English - Date: 2008-10-07 04:07:53 Complexity classes Computational complexity theory Boolean algebra Structural complexity theory NP-complete problems Boolean satisfiability problem NP PP Reduction True quantified Boolean formula Exponential time hypothesis P
212	Distributed Computing manuscript No. (will be inserted by the editor) Distributed Minimum Dominating Set Approximations in Restricted Families of Graphs Christoph Lenzen · Yvonne-Anne Pignolet · Roger Wattenhofer Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-05-29 10:12:12 NP-complete problems Maximal independent set Treewidth Arboricity Dominating set Planar graph Independent set Matching Graph minor Bipartite graph Line graph Planar separator theorem
213	Fast Distributed Network Decompositions and Covers Baruch Awerbuch y Bonnie Berger z David Peleg { Add to Reading List Source URL: www.cs.tufts.edu Language: English - Date: 2012-10-31 09:54:24 NP-complete problems Graph coloring Matroid theory Graph connectivity Ear decomposition Neighbourhood Degeneracy Maximal independent set Independent set Bridge Graph theory Treewidth
214	CS261: A Second Course in Algorithms Lecture #15: Introduction to Approximation Algorithms∗ Tim Roughgarden† February 23, 2016 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-02-28 14:26:27 NP-complete problems Knapsack problem Set cover problem Steiner tree problem Vertex cover Approximation algorithm Greedy algorithm Dynamic programming Minimum spanning tree Algorithm Time complexity NP
215	Combining Constraint Programming, Lagrangian Relaxation and Probabilistic Algorithms to solve the Vehicle Routing Problem Daniel Guimarans1 , Rosa Herrero1 , Daniel Riera2 , Angel A. Juan2 , and Juan Jos´e Ramos1 1 Add to Reading List Source URL: ceur-ws.org Language: English - Date: 2010-05-18 03:15:30 Operations research Mathematical optimization Search algorithms NP-complete problems Combinatorial optimization Variable neighborhood search Vehicle routing problem Travelling salesman problem Heuristic A* search algorithm Lagrangian relaxation Local search
216	Parameterized Complexity of the Weighted Independent Set Problem beyond Graphs of Bounded Clique Number∗† Konrad Dabrowski1 , Vadim Lozin1‡, Haiko M¨ uller2 , and Dieter Rautenbach3 1 Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2012-04-30 01:44:46 NP-complete problems Chordal graph Bipartite graph Clique problem Interval graph Claw-free graph Clique Graph minor Perfect graph Split graph Independent set Graph
217	Reconfiguring Independent Sets in Claw-Free Graphs∗ Paul Bonsma† Marcin Kami´ nski‡ Add to Reading List Source URL: rutcor.rutgers.edu Language: English - Date: 2015-07-28 10:23:00 NP-complete problems Graph operations Graph coloring Line graph Dominating set Claw-free graph Chordal graph Graph Neighbourhood Independent set Matching Median graph
218	CS264: Homework #7 Due by midnight on Wednesday, November 12, 2014 Instructions: (1) Students taking the course pass-fail should complete the exercises. Students taking the course for a letter grade should complete both Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-11-06 11:24:24 NP-complete problems Combinatorial optimization Maximum cut Knapsack problem
219	June 23, :19 WSPC - Proceedings Trim Size: 9in x 6in Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2009-07-03 08:57:08 Graph coloring NP-complete problems Graph theory Matching Color-coding Graph Chromatic polynomial Tree-depth
220	Maximum Motif Problem in Vertex-Colored Graphs ? Riccardo Dondi1 , Guillaume Fertin2 , and St´ephane Vialette3 1 Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2011-04-27 05:28:57 NP-complete problems Graph coloring Graph connectivity Combinatorial optimization Matching Vertex cover Bridge Color-coding Treewidth Neighbourhood Covering graph Incidence coloring

UPDATE