Sciweavers

179 search results - page 10 / 36
» Polynomial Time Approximation Schemes for Geometric k-Cluste...
Sort
View
SIAMCOMP
2011
12 years 10 months ago
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
IPL
2002
90views more  IPL 2002»
13 years 7 months ago
On the approximability of two tree drawing conventions
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...
Paolo Penna
AAAI
2012
11 years 10 months ago
Optimal Proportional Cake Cutting with Connected Pieces
We consider the classic cake cutting problem where one allocates a divisible cake to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. social wel...
Xiaohui Bei, Ning Chen, Xia Hua, Biaoshuai Tao, En...
SODA
2004
ACM
161views Algorithms» more  SODA 2004»
13 years 9 months ago
Approximation schemes for Metric Bisection and partitioning
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...
Wenceslas Fernandez de la Vega, Marek Karpinski, C...
COMPGEOM
2009
ACM
14 years 2 months ago
Near-linear approximation algorithms for geometric hitting sets
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
Pankaj K. Agarwal, Esther Ezra, Micha Sharir