Sciweavers

176 search results - page 18 / 36
» Unbalanced Points and Vertices Problem
Sort
View
COMGEO
2006
ACM
14 years 9 months ago
Inner and outer rounding of Boolean operations on lattice polygonal regions
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementat...
Olivier Devillers, Philippe Guigue
IPCO
2001
166views Optimization» more  IPCO 2001»
14 years 10 months ago
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
Fabián A. Chudak, Tim Roughgarden, David P....
CCCG
2009
14 years 7 months ago
Wireless Localization with Vertex Guards is NP-hard
We consider a special class of art gallery problems inspired by wireless localization. Given a simple polygon P, place and orient guards each of which broadcasts a unique key with...
Tobias Christ, Michael Hoffmann
GD
2004
Springer
15 years 2 months ago
No-Three-in-Line-in-3D
The no-three-in-line problem, introduced by Dudeney in 1917, asks for the maximum number of points in the n × n grid with no three points collinear. In 1951, Erd¨os proved that t...
Attila Pór, David R. Wood
CDC
2009
IEEE
115views Control Systems» more  CDC 2009»
15 years 2 months ago
Quantized consensus via adaptive stochastic gossip algorithm
Abstract— This paper is concerned with the distributed averaging problem over a given undirected graph. To enable every vertex to compute the average of the initial numbers sitti...
Javad Lavaei, Richard M. Murray