Sciweavers

1279 search results - page 40 / 256
» Approximation Algorithms for Min-Max Generalization Problems
Sort
View
COMPGEOM
2007
ACM
14 years 19 days ago
Medial axis approximation from inner Voronoi balls: a demo of the Mesecina tool
We illustrate a simple algorithm for approximating the medial axis of a 2D shape with smooth boundary from a sample of this boundary. The algorithm is compared to a more general a...
Balint Miklos, Joachim Giesen, Mark Pauly
WAOA
2010
Springer
209views Algorithms» more  WAOA 2010»
13 years 6 months ago
Densest k-Subgraph Approximation on Intersection Graphs
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
Danny Z. Chen, Rudolf Fleischer, Jian Li
DAGSTUHL
2004
13 years 10 months ago
Optimal Approximation of Elliptic Problems by Linear and Nonlinear Mappings
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
Erich Novak, Stephan Dahlke, Winfried Sickel
TSP
2008
115views more  TSP 2008»
13 years 8 months ago
Approximation Bounds for Semidefinite Relaxation of Max-Min-Fair Multicast Transmit Beamforming Problem
Consider a downlink multicast scenario where a base station equipped with multiple antennas wishes to simultaneously broadcast a number of signals to some given groups of users ove...
Tsung-Hui Chang, Zhi-Quan Luo, Chong-Yung Chi
SODA
2012
ACM
240views Algorithms» more  SODA 2012»
11 years 11 months ago
Simultaneous approximations for adversarial and stochastic online budgeted allocation
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
Vahab S. Mirrokni, Shayan Oveis Gharan, Morteza Za...