NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
381	Kannan and Wheeler Algorithms for Molecular Biology 2012, 7:9 http://www.almob.org/contentRESEARCH Open Access Add to Reading List Source URL: www.almob.org Language: English Phylogenetics NP-complete problems Graph Maximum parsimony Routing algorithms Tree Phylogenetic network Steiner tree problem Directed acyclic graph Graph theory Mathematics Theoretical computer science
382	CS 170 Algorithms Spring 2009 Add to Reading List Source URL: www-inst.eecs.berkeley.edu Language: English - Date: 2009-05-04 23:56:17 Complexity classes NP-complete problems Boolean algebra Electronic design automation Formal methods Boolean satisfiability problem Conjunctive normal form NP-complete Canonical form Theoretical computer science Mathematics Applied mathematics
383	An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem Arash Asadpour∗ ‡ Michel X. Goemans† Add to Reading List Source URL: www.stanford.edu Language: English - Date: 2009-10-28 12:34:47 Spanning tree Loop-erased random walk Minimum spanning tree Chernoff bound Eulerian path NP-complete problems Dominating set Tutte polynomial Graph theory Mathematics Theoretical computer science
384	Technical Report TTIC-TRMarch 2010 Dynamic Well-Spaced Point Sets Umut A. Acar Add to Reading List Source URL: www.ttic.edu Language: English - Date: 2012-09-18 12:01:28 NP-complete problems Delaunay triangulation Triangulation Voronoi diagram Discrete mathematics Mathematics Theoretical computer science Computational geometry
385	Tree-based Coarsening and Partitioning of Complex Networks Roland Glantz, Henning Meyerhenke, and Christian Schulz arXiv:1402.2782v2 [cs.DS] 13 Feb 2014 Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-02-13 20:08:15 Graph connectivity Combinatorial optimization Spanning tree NP-complete problems Graph partition Vertex Minimum spanning tree Edge contraction Tree Graph theory Mathematics Theoretical computer science
386	CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () HW#3 – Due at the beginning of class ThursdayConsider a model of a nonbipartite undirected graph in which two partic Add to Reading List Source URL: stanford.edu Language: English - Date: 2015-03-23 01:42:07 NP-complete problems Clique problem Vertex cover Matching Eulerian path Clique Minimum spanning tree Randomized algorithm Connectivity Graph theory Theoretical computer science Mathematics
387	6.889 — Lecture 15: Traveling Salesman (TSP) Christian Sommer (figures by Philip Klein) November 2, 2011 Traveling Salesman Problem (TSP) given G = (V, E) find a tour visiting each1 node v ∈ V . NP–har Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-11-29 11:50:24 Spanning tree NP-complete problems Operations research Travelling salesman problem Graph operations Minimum spanning tree Graph Planar graph Eulerian path Graph theory Theoretical computer science Mathematics
388	UC Berkeley—CS 170 Lecturer: David Wagner Problem Set 12 Due on May 13 at 3:30 p.m. Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2015-01-21 19:48:42 NP-complete problems Complexity classes Mathematical optimization NP-complete P versus NP problem NP Time complexity Vertex cover Hamiltonian path Theoretical computer science Computational complexity theory Applied mathematics
389	Discrete Applied Mathematics–49 Annealed replication: a new heuristic for the maximum clique problem Immanuel M. Bomzea; ∗ , Marco Budinichb , Marcello Pelilloc , Claudio Rossic Add to Reading List Source URL: www.dais.unive.it Language: English - Date: 2002-12-03 08:21:13 NP-complete problems Functional languages Procedural programming languages Recursion Clique problem Mathematical optimization Clique Independent set Dynamical system Theoretical computer science Mathematics Applied mathematics
390	PDF Document Add to Reading List Source URL: web.eecs.umich.edu Language: English - Date: 2014-02-11 03:59:44 Combinatorial optimization NP-complete problems Matching Cut Shortest path problem Time complexity Maximum cut Travelling salesman problem Hungarian algorithm Theoretical computer science Graph theory Mathematics

UPDATE