Hardness of approximation - PDFSEARCH.IO - Document Search Engine

Hardness of approximation
Results: 23

#	Item
1	Hardness of approximation for vertex-connectivity network design problems Guy Kortsarz∗ Robert Krauthgamer† Add to Reading List Source URL: crab.rutgers.edu Language: English - Date: 2010-10-08 18:13:37
2	Amplified Hardness of Approximation for VCG-Based Mechanisms Shaddin Dughmi Department of Computer Science Stanford University Add to Reading List Source URL: www.fuhuthu.com Language: English - Date: 2014-05-21 16:31:02
3	We present first massively parallel (MPC) algorithms and hardness of approximation results for computing Single-Linkage Clustering of n input d-dimensional vectors under Hamming, `1 , `2 and `1 distances. All our algorit Add to Reading List Source URL: vision.soic.indiana.edu Language: English - Date: 2018-04-02 11:03:41
4	Hardness and Approximation of The Asynchronous Border Minimization Problem (Extended Abstract) Alexandru Popa1 , Prudence W.H. Wong2 , and Fencol C.C. Yung2 1 Add to Reading List Source URL: cgi.csc.liv.ac.uk - Date: 2012-04-11 18:38:10
5	Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014 Add to Reading List Source URL: resources.mpi-inf.mpg.de Language: English - Date: 2014-06-04 08:46:15 Computational complexity theory Mathematics NP-complete problems Theory of computation Packing problems Operations research Approximation algorithms Knapsack problem Vertex cover Bin packing problem Hardness of approximation Algorithm
6	Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:44:56 Computational complexity theory Theory of computation Complexity classes Approximation algorithms Computational hardness assumptions Polynomial-time approximation scheme Time complexity NC Reduction Exponential time hypothesis NP-hardness NP
7	New Hardness Results for Diophantine Approximation Friedrich Eisenbrand & Thomas Rothvoß Institute of Mathematics EPFL, Lausanne Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Computational complexity theory Diophantine approximation Approximation algorithm
8	Distributed Verification and Hardness of Distributed ∗ Approximation Atish Das Sarma † Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-05-18 12:16:16 Graph theory Mathematics Computational complexity theory Spanning tree NP-complete problems Dominating set Minimum spanning tree Maximal independent set Matching Travelling salesman problem Shortest path problem Tree
9	Approximation Algorithms and Hardness of Integral Concurrent Flow ∗ Parinya Chalermsook† Julia Chuzhoy ‡ Add to Reading List Source URL: ttic.uchicago.edu Language: English - Date: 2012-05-23 11:17:06
10	Approximation Algorithms and Hardness of the k-Route Cut Problem∗ Julia Chuzhoy† Yury Makarychev‡ Add to Reading List Source URL: ttic.uchicago.edu Language: English - Date: 2011-12-15 13:20:22