Sciweavers

536 search results - page 1 / 108
» The hardness and approximation algorithms for l-diversity
Sort
View
JCO
2007
128views more  JCO 2007»
14 years 10 months ago
Approximation algorithms and hardness results for labeled connectivity problems
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
Refael Hassin, Jérôme Monnot, Danny S...
STOC
2012
ACM
227views Algorithms» more  STOC 2012»
13 years 22 days ago
Approximation algorithms and hardness of integral concurrent flow
Parinya Chalermsook, Julia Chuzhoy, Alina Ene, Shi...
SODA
2012
ACM
210views Algorithms» more  SODA 2012»
13 years 22 days ago
Approximation algorithms and hardness of the k-route cut problem
Julia Chuzhoy, Yury Makarychev, Aravindan Vijayara...