NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
41	–Independent Work Report Spring,2014– Exploring Self-Organizing Learning Groups in an Online Learning Platform: Classroom Salon Brandon Lam Advisor: Dr. Ananda Gunawardena Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2014-05-16 16:36:56 Graph theory Computational linguistics Mathematics NP-complete problems Knowledge representation Open data Thesauri WordNet Clique Word square
42	A Polynomial-Time Approximation Scheme for Maximum Quartet Compatibility Add to Reading List Source URL: tandy.cs.illinois.edu Language: English - Date: 2015-04-08 19:35:45 Computational complexity theory Theory of computation Complexity classes NP-complete problems Combinatorial optimization Packing problems Approximation algorithms Knapsack problem NP APX
43	Although the result is correct, the algorithm and analysis presented in this paper contain non-trivial errors. These have been fixed in a technical report (availabe at http://www.disco.ethz.ch/publications/planarmds_-1.p Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:22 Graph theory NP-complete problems Maximal independent set Independent set Dominating set Vertex cover Graph coloring Planar graph Graph minor Planar separator theorem Tree decomposition
44	A. Daneshgar: Extended abstract of my talk at IUTFebruaryDo Graphs Admit Topological Field Theories? Amir Daneshgar Add to Reading List Source URL: sharif.ir Language: English - Date: 2013-10-17 07:17:33 Graph theory Mathematics Graph operations NP-complete problems Graph coloring Topological graph theory Line graph Graph homomorphism Graph Graph property Signed graph
45	Online Matching: Haste makes Waste! (Full Version)∗ Yuval Emek† Shay Kutten‡ Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2016-06-22 05:23:03 Graph theory Mathematics Computational complexity theory NP-complete problems Matching Combinatorial optimization Dominating set Vertex cover Transportation theory Distribution
46	TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel Add to Reading List Source URL: www.iwr.uni-heidelberg.de Language: English - Date: 2013-06-19 04:16:58 Graph theory Mathematics Computational complexity theory NP-complete problems Graph Travelling salesman problem Vertex Cycle Hamiltonian path Graph automorphism Vertex cover
47	1 Optimizing Busy Time on Parallel Machines George B. Mertzios∗ , Mordechai Shalom† , Ariella Voloshin‡ , Prudence W.H. Wong§ and Shmuel Zaks‡ ∗ School of Engineering and Computing Sciences, Durham University Add to Reading List Source URL: cgi.csc.liv.ac.uk Language: English - Date: 2012-02-08 11:20:14 Graph theory Mathematics Operations research Mathematical optimization NP-complete problems Dynamic programming Equations Systems engineering Independent set Interval scheduling Interval graph Approximation algorithm
48	ON THE RANDOM-SELF-REDUCIBILITY OF COMPLETE SETS JOAN FEIGENBAUMy AND LANCE FORTNOWz Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2001-10-25 12:45:35 Computational complexity theory Theory of computation Complexity classes Structural complexity theory Conjectures Probability distributions NP Polynomial hierarchy IP P versus NP problem PP P
49	arXiv:1602.07940v2 [physics.data-an] 6 MayThe scaling of the minimum sum of edge lengths in uniformly random trees Juan Luis Esteban1 , Ramon Ferrer-i-Cancho2 and Carlos G´ Add to Reading List Source URL: www.grupolys.org Language: English - Date: 2016-05-11 06:39:57 Graph theory NP-complete problems Spanning tree Axiom of choice Graph coloring Tree
50	CS264: Homework #5 Due by midnight on Wednesday, October 29, 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-27 18:59:34 Graph theory NP-complete problems Clique Clique cover Graph coloring