OL

2010

12 years 11 months ago
2010

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...

CORR

2011

Springer

12 years 11 months ago
2011

Springer

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...

TALG

2010

13 years 2 months ago
2010

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...

COMGEO

2002

ACM

13 years 4 months ago
2002

ACM

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 ...

FAW

2010

Springer

13 years 4 months ago
2010

Springer

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...

SODA

2007

ACM

13 years 5 months ago
2007

ACM

We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam ﬁghting, e-c...

SIGECOM

2010

ACM

13 years 9 months ago
2010

ACM

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 ...

FOCS

2007

IEEE

13 years 10 months ago
2007

IEEE

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...

FOCS

2009

IEEE

13 years 11 months ago
2009

IEEE

We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an eﬃcient algorithm). We generalize this result to ...

SODA

2010

ACM

14 years 1 months ago
2010

ACM