Sciweavers

1672 search results - page 48 / 335
» Tightness problems in the plane
Sort
View
WONS
2005
IEEE
14 years 2 months ago
Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks
—Wireless ad hoc radio networks have gained a lot of attention in recent years. We consider geometric networks, where nodes are located in a euclidean plane. We assume that each ...
Alexander Kesselman, Dariusz R. Kowalski
INFOCOM
2011
IEEE
13 years 6 days ago
There's something about MRAI: Timing diversity can exponentially worsen BGP convergence
—To better support interactive applications, individual network operators are decreasing the timers that affect BGP convergence, leading to greater diversity in the timer setting...
Alex Fabrikant, Umar Syed, Jennifer Rexford
IPCO
2001
184views Optimization» more  IPCO 2001»
13 years 10 months ago
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
Clifford Stein, David P. Wagner
ICCSA
2003
Springer
14 years 2 months ago
Red-Blue Separability Problems in 3D
In this paper we study the problems of separability of two disjoint point sets in 3D by multiple criteria extending some notions on separability of two disjoint point sets in the ...
Ferran Hurtado, Carlos Seara, Saurabh Sethia
CCCG
2004
13 years 10 months ago
On computing enclosing isosceles triangles and related problems
Given a set of n points in the plane, we show how to compute various enclosing isosceles triangles where different parameters such as area or perimeter are optimized. We then stud...
Prosenjit Bose, Carlos Seara, Saurabh Sethia