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

	Coordination Mechanisms, Cost-Sharing, and Approximation Algorithms for Scheduling Ioannis Caragiannis1 , Vasilis Gkatzelis2 , and Cosimo Vinci3 1 University of Patras, Rion-Patras, Greece DocID: 1xTKO - View Document
	Approximation algorithms An algorithm has approximation ratio r if it outputs solutions with cost such that c/c* ≤ r and c/c ≤ r where c is the optimal cost. DocID: 1vcdB - View Document
	Greedy approximation algorithms for dire ted multi uts Yana Kortsarts Guy Kortsarz Widener University DocID: 1uQsZ - View Document
	Fixed-Parameter and Approximation Algorithms: A New Look Rajesh Chitnis ∗ MohammadTaghi Hajiaghayi∗ Guy Kortsarz† DocID: 1uPZi - View Document
	Approximation Algorithms for Network Design Problems with Node Weights C. Chekuri∗ M. T. Hajiaghayi† DocID: 1uLSz - View Document