574 search results - page 16 / 115 » Approximation Algorithms for Free-Label Maximization |
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We present a near-quadratic time algorithm that computes a point inside a simple polygon P having approximately the largest visibility polygon inside P, and a nearlinear time algo...
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
Many commonly-used auction mechanisms are "maximal-in-range". We show that any maximalin-range mechanism for n bidders and m items cannot both approximate the social wel...