Sciweavers

1941 search results - page 15 / 389
» On the Hardness of Approximate Reasoning
Sort
View
SIAMCOMP
2008
101views more  SIAMCOMP 2008»
15 years 6 months ago
Combination Can Be Hard: Approximability of the Unique Coverage Problem
We prove semi-logarithmic inapproximability for a maximization problem called unique coverage: given a collection of sets, find a subcollection that maximizes the number of elemen...
Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiag...
CORR
2010
Springer
71views Education» more  CORR 2010»
15 years 3 months ago
Distributed Verification and Hardness of Distributed Approximation
Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Ko...
STOC
2012
ACM
227views Algorithms» more  STOC 2012»
13 years 8 months ago
Approximation algorithms and hardness of integral concurrent flow
Parinya Chalermsook, Julia Chuzhoy, Alina Ene, Shi...