Sciweavers

50 search results - page 8 / 10
» Improved approximation algorithms for rectangle tiling and p...
Sort
View
STOC
2010
ACM
245views Algorithms» more  STOC 2010»
15 years 2 months ago
Weighted Geometric Set Cover via Quasi-Uniform Sampling
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
Kasturi Varadarajan
GMP
2008
IEEE
161views Solid Modeling» more  GMP 2008»
15 years 4 months ago
Slit Map: Conformal Parameterization for Multiply Connected Surfaces
Surface parameterization is a fundamental tool in geometric modeling and processing. Most existing methods deal with simply connected disks. This work introduces a novel method to ...
Xiaotian Yin, Junfei Dai, Shing-Tung Yau, Xianfeng...
COMPGEOM
2008
ACM
14 years 11 months ago
Circular partitions with applications to visualization and embeddings
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
Krzysztof Onak, Anastasios Sidiropoulos
FOCS
2009
IEEE
15 years 4 months ago
Symmetry and Approximability of Submodular Maximization Problems
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
Jan Vondrák
FOCS
2000
IEEE
15 years 1 months ago
Approximating the single source unsplittable min-cost flow problem
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
Martin Skutella