Sciweavers

Share
OL
2010
140views more  OL 2010»
8 years 9 months ago
Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...
Balabhaskar Balasundaram, Shyam Sundar Chandramoul...
CORR
2011
Springer
177views Education» more  CORR 2011»
8 years 9 months ago
A Truthful Randomized Mechanism for Combinatorial Public Projects via Convex Optimization
In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of selfinterested players with a stake in the set of projects chosen. A public plann...
Shaddin Dughmi
TALG
2010
109views more  TALG 2010»
9 years 27 days ago
Facility location with hierarchical facility costs
We introduce a facility location problem with submodular facility cost functions, and give an O(log n) approximation algorithm for it. Then we focus on a special case of submodula...
Zoya Svitkina, Éva Tardos
COMGEO
2002
ACM
9 years 2 months ago
Quadtree, ray shooting and approximate minimum weight Steiner triangulation
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...
Siu-Wing Cheng, Kam-Hing Lee
FAW
2010
Springer
225views Algorithms» more  FAW 2010»
9 years 2 months ago
Computing Minimum Diameter Color-Spanning Sets
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...
Rudolf Fleischer, Xiaoming Xu
SODA
2007
ACM
145views Algorithms» more  SODA 2007»
9 years 3 months ago
Aggregation of partial rankings, p-ratings and top-m lists
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...
Nir Ailon
SIGECOM
2010
ACM
156views ECommerce» more  SIGECOM 2010»
9 years 7 months ago
Robust mechanisms for risk-averse sellers
The existing literature on optimal auctions focuses on optimizing the expected revenue of the seller, and is appropriate for risk-neutral sellers. In this paper, we identify good ...
Mukund Sundararajan, Qiqi Yan
FOCS
2007
IEEE
9 years 8 months ago
Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence
We show that any deterministic data-stream algorithm that makes a constant number of passes over the input and gives a constant factor approximation of the length of the longest i...
Anna Gál, Parikshit Gopalan
FOCS
2009
IEEE
9 years 9 months ago
Decomposing Coverings and the Planar Sensor Cover Problem
We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an efficient algorithm). We generalize this result to ...
Matt Gibson, Kasturi R. Varadarajan
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
9 years 12 months ago
A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover
Nikhil Bansal, Anupam Gupta, Ravishankar Krishnasw...
books