Sciweavers

1604 search results - page 36 / 321
» Approximation algorithms for developable surfaces
Sort
View
SWAT
2010
Springer
269views Algorithms» more  SWAT 2010»
14 years 1 months ago
Approximation Algorithms for Free-Label Maximization
Inspired by air traffic control and other applications where moving objects have to be labeled, we consider the following (static) point labeling problem: given a set P of n points...
Mark de Berg, Dirk H. P. Gerrits
CGF
2010
95views more  CGF 2010»
13 years 8 months ago
Polygonal Surface Advection applied to Strange Attractors
Strange attractors of 3D vector field flows sometimes have a fractal geometric structure in one dimension, and smooth surface behavior in the other two. General flow visualization...
S. Yan, N. Max, K.-L. Ma
ESA
2011
Springer
251views Algorithms» more  ESA 2011»
12 years 8 months ago
Improved Approximation Algorithms for Bipartite Correlation Clustering
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke...
EDBT
2010
ACM
110views Database» more  EDBT 2010»
14 years 3 months ago
The hardness and approximation algorithms for l-diversity
The existing solutions to privacy preserving publication can be classified into the theoretical and heuristic categories. The former guarantees provably low information loss, whe...
Xiaokui Xiao, Ke Yi, Yufei Tao
ICALP
2009
Springer
14 years 9 months ago
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...