A Polynomial-Time Approximation Scheme for Maximum Quartet Compatibility

First Page		Document Content
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		A Polynomial-Time Approximation Scheme for Maximum Quartet Compatibility Add to Reading List Source URL: tandy.cs.illinois.edu Download Document from Source Website File Size: 328,92 KB Share Document on Facebook

	Ng Kong Beng Public Lecture Series 黄光明公开讲座 For the past 40 years computer scientists generally believed that NP-complete problems are intractable. In particular, Boolean satisfiability (SAT), as a paradigma DocID: 1udfk - View Document
	Djinni 2.1 Approximating NP-Complete Problems, Fast Jeff Ohlmann, Barrett Thomas, Robert Hansen, Tristan Thiede Presented at OSCON 2006 DocID: 1tIrp - View Document
	Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights Reserved DocID: 1rtvU - View Document
	On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon DocID: 1rsZm - View Document
	Induced paths of given parity in planar graphs Naomi Nishimura University of Waterloo Canada DocID: 1rsEH - View Document