NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
481	On Problems as Hard as CNF-SAT∗ Marek Cygan† Holger Dell‡ Jesper Nederlofk Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-03-27 21:09:14 NP-complete problems Exponential time hypothesis Conjunctive normal form Boolean satisfiability problem Vertex cover Set cover problem Time complexity Graph coloring Independent set Theoretical computer science Computational complexity theory Applied mathematics
482	Automatic Selection of Pattern Collections for Domain Independent Planning MASTER THESIS PRESENTATION MSC THESIS SASCHA SCHERRER, UNIVERSITY BASEL Add to Reading List Source URL: ai.cs.unibas.ch Language: English - Date: 2014-07-18 11:42:15 Knowledge Operations research Heuristic function NP-complete problems Heuristic Search algorithm A* search algorithm Algorithm Thesis Mathematics Heuristics Applied mathematics
483	CCCG 2011, Toronto ON, August 10–12, 2011 Bottleneck Steiner Tree with Bounded Number of Steiner Vertices A. Karim Abu-Affash∗ Paz Carmi† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-15 18:22:15 NP-complete problems Spanning tree Steiner tree problem NP-hard problems Minimum spanning tree Tree Vertex cover Rectilinear Steiner tree Connectivity Graph theory Theoretical computer science Mathematics
484	Tractable Parameterizations for the Minimum Linear Arrangement Problem Michael R. Fellows1 , Danny Hermelin2 , Frances Rosamond1 , and Hadas Shachnai3 1 Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-06-22 19:48:39 NP-complete problems Vertex cover Tree decomposition Graph Voltage graph Dominating set Graph theory Theoretical computer science Mathematics
485	A Theory and Algorithms for Combinatorial Reoptimization? Hadas Shachnai1?? , Gal Tamir1 , and Tami Tamir2 1 2 Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-02-29 12:43:33 Operations research Complexity classes NP-complete problems Approximation algorithm Optimization problem Reduction NP Knapsack problem Dynamic programming Theoretical computer science Applied mathematics Computational complexity theory
486	INFORMS TRANSPORTATION SCIENCE Vol. 00, No. 0, Xxxxx 0000, pp. 000–000 issn \| eissn \| 00 \| 0000 \| 0001 Add to Reading List Source URL: tbenoist.pagesperso-orange.fr Language: English - Date: 2011-03-16 02:49:18 Mathematics NP-complete problems Supply chain management Marketing Heuristics Inventory Vehicle routing problem Travelling salesman problem Heuristic function Business Theoretical computer science Operations research
487	Counting Eulerian Circuits is #P-Complete Graham R. Brightwell Abstract We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P. The method employed is mod Add to Reading List Source URL: www.siam.org Language: English - Date: 2005-07-06 08:19:12 Eulerian path NP-complete problems BEST theorem Degree Connectivity Hamiltonian path Tree Graph Route inspection problem Graph theory Mathematics Theoretical computer science
488	Computational Aspects of Multi-Winner Approval Voting Haris Aziz Serge Gaspers Joachim Gudmundsson Add to Reading List Source URL: www.nickmattei.net Language: English - Date: 2015-03-01 18:24:36 Social choice theory Voting system criteria Politics Voting theory Voting system Approval voting Tactical voting Condorcet criterion NP-complete Psephology Voting Single winner electoral systems
489	Distributed Computing FS 2013 Prof. R. Wattenhofer Thomas Locher Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:47 NP-complete problems Graph coloring Networks Connectivity Dominating set Edge coloring Network theory Copying mechanism Breadth-first search Graph theory Theoretical computer science Mathematics
490	A New Approach to Incremental Topological Ordering Michael A. Bender∗ Jeremy T. Fineman† Abstract Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2009-11-24 09:49:23 Search algorithms Network flow Topological sorting Directed acyclic graph Depth-first search Minor Tree NP-complete problems Spanning tree Graph theory Mathematics Combinatorics

UPDATE