215 search results - page 1 / 43 » Approximating Geometrical Graphs via |
STOC
1998
ACM
13 years 9 months ago
1998
ACM
ISAAC
2009
Springer
13 years 12 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
GD
2006
Springer
13 years 9 months ago
2006
Springer
Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. However additional work must still be done to dra...
STOC
2010
ACM
13 years 10 months ago
2010
ACM
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 ...
CCCG
2010
13 years 6 months ago
2010
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...