NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
541	A Memory-Efficient Method for Fast Computation of Short 15-Puzzle Solutions Ian Parberry Technical Report LARCLaboratory for Recreational Computing Department of Computer Science & Engineering Add to Reading List Source URL: larc.unt.edu Language: English - Date: 2014-04-24 15:56:54 Mechanical puzzles Puzzles Combination puzzles NP-complete problems Fads Fifteen puzzle Eternity II puzzle Greedy algorithm Shortest path problem Mathematics Games Theoretical computer science
542	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Covering Orthogonal Polygons with Sliding k-transmitters Salma Sadat Mahdavi∗ Saeed Seddighin Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-08-05 11:21:00 Complexity classes Polygons Structural complexity theory Mathematical optimization Art gallery problem Approximation algorithm Reduction NP-complete Optimization problem Theoretical computer science Computational complexity theory Applied mathematics
543	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Geometric Red-Blue Set Cover for Unit Squares and Related Problems Timothy M. Chan∗ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 Vertex cover Set cover problem Monotone polygon NP-complete problems Mathematics Applied mathematics
544	CCCG 2006, Kingston, Ontario, August 14–16, 2006 Hamiltonian Cycles in Triangular Grids Valentin Polishchuk∗ Esther M. Arkin† Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-27 22:57:41 Induced path Cycle graph Planar graph Path Petersen graph Panconnectivity Graph theory NP-complete problems Hamiltonian path
545	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: www.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
546	70 CHAPTER 7. MAXIMAL INDEPENDENT SET Remarks: • Computing a maximum independent set (MaxIS) is a notoriously difficult Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:48 Combinatorial optimization NP-complete problems Routing algorithms Search algorithms Matching Randomized algorithm Graph coloring Connectivity Dominating set Mathematics Theoretical computer science Graph theory
547	ICS 260 – Fall 2001 – Final Exam Name: Answer Key Student ID: 1: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2001-12-12 17:36:39 NP-complete problems Travelling salesman problem Independent set NP-complete Set cover problem NP Directed acyclic graph Kernelization Vertex cover Theoretical computer science Computational complexity theory Mathematics
548	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Stabbing Polygonal Chains with Rays is Hard to Approximate Steven Chaplick∗ Elad Cohen† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:57 NP-complete problems Vertex cover Reduction Ordinal number Parameterized complexity Cardinality APX Set cover problem Polygonal chain Theoretical computer science Computational complexity theory Mathematics
549	Covering Number for Efficient Heuristic-Based POMDP Planning Zongzhang Zhang ZHANGZZ @ COMP. NUS . EDU . SG David Hsu DYHSU @ COMP. NUS . EDU . SG Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2014-07-04 06:57:08 Dynamic programming Partially observable Markov decision process Stochastic control Branch and bound NP-complete problems Statistics Mathematics Theoretical computer science
550	16th Canadian Conference on Computational Geometry, 2004 An Average Running Time Analysis of a Backtracking Algorithm to Calculate the Measure of the Union of Hyperrectangles in Dimensions Susumu Suzuki Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 Operations research NP-complete problems Search algorithms Analysis of algorithms Boolean satisfiability problem Backtracking Algorithm PP Time complexity Theoretical computer science Applied mathematics Computational complexity theory

UPDATE