NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
171	Moment methods in energy minimization David de Laat Delft University of Technology (Joint with Fernando Oliveira and Frank Vallentin) L´aszl´ Add to Reading List Source URL: www.daviddelaat.nl Language: English Operations research Discrete geometry NP-complete problems Conjectures Circle packing Sphere packing Independent set Kepler conjecture Tammes problem Mathematical optimization Semidefinite programming FranklRdl graph
172	CS261: A Second Course in Algorithms Lecture #19: Beating Brute-Force Search∗ Tim Roughgarden† March 8, 2016 A popular myth is that, for N P -hard problems, there are no algorithms with worst-case running time better Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-03-15 10:47:56 NP-complete problems Computational complexity theory Analysis of algorithms Operations research NP-hard problems Vertex cover Travelling salesman problem Dynamic programming Parameterized complexity Independent set Algorithm 2-satisfiability
173	The Price of Connectivity for Feedback Vertex Set R´emy Belmonte1,∗ , Pim van ’t Hof1,∗ , Marcin Kami´ nski2 , and 3,† Dani¨el Paulusma 1 Add to Reading List Source URL: rutcor.rutgers.edu Language: English - Date: 2013-04-23 04:25:37 Graph theory NP-complete problems Planar graph Dominating set Vertex Degree Cycle Line graph Bidimensionality
174	Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem Ant´ onio Morgado and Joao Marques-Silva School of Electronics and Computer Science, University of Southampton, UK ,jpms@e Add to Reading List Source URL: ceur-ws.org Language: English - Date: 2008-12-04 03:04:56 Operations research Mathematical optimization Constraint programming Logic in computer science NP-complete problems Topology Satisfiability modulo theories Dynamic programming Semidefinite programming
175	Coreset and sampling approaches for the analysis of very large data sets – Part II Christian Sohler Prof. Dr. Christian Sohler Komplexitätstheorie und Add to Reading List Source URL: quentin.mrgt.fr Language: English - Date: 2014-01-09 09:41:45 Graph theory Graph NP-complete problems Graph coloring
176	One-Dimensional Partitioning for Heterogeneous Systems: Theory and Practice ⋆ Ali Pınar a,1, E. Kartal Tabak b and Cevdet Aykanat b,2 Add to Reading List Source URL: www.sandia.gov Language: English - Date: 2012-03-07 01:50:39 NP-complete problems Operations research Combinatorial optimization Parallel computing Mathematical optimization Parametric search Algorithm Dynamic programming Greedy algorithm Partition problem Distributed computing Approximation algorithm
177	SIAM J. DISCRETE MATH. Vol. 26, No. 3, pp. 940–963 c 2012 Society for Industrial and Applied Mathematics Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2012-10-09 12:22:03 NP-complete problems Search algorithms Permutation graph Chordal graph Graph Permutation Longest path problem Hamiltonian path Comparability graph Depth-first search Interval graph Skew-symmetric graph
178	CS264: Homework #4 Due by midnight on Wednesday, October 22, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at http://rishig.sc Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-10-16 11:28:02 NP-complete problems Vertex cover Maximum cut Dynamic programming Algorithm Kernelization Approximation algorithm
179	Maximal Strip Recovery Problem with Gaps: Hardness and Approximation AlgorithmsI Laurent Bulteau, Guillaume Fertin, Irena Rusu Laboratoire d’Informatique de Nantes-Atlantique (LINA), UMR CNRS 6241 Université de Nantes Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2013-01-07 10:28:20 Computational problems NP-complete problems Optimization problem Synteny Independent set
180	CS264: Beyond Worst-Case Analysis Lecture #5: Computing Independent Sets: A Parameterized Analysis ∗ Tim Roughgarden† October 8, 2014 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-11-02 12:35:58 NP-complete problems Approximation algorithm Independent set Algorithm Maximal independent set Longest path problem Vertex cover

UPDATE