27 search results - page 1 / 6 » Long Alternating Paths in Bicolored Point Sets |
GD
2004
Springer
14 years 4 months ago
2004
Springer
Given n red and n blue points in convex position in the plane, we show that there exists a noncrossing alternating path of length n + c n log n . We disprove a conjecture of Erd˝o...
GC
2006
Springer
13 years 11 months ago
2006
Springer
It is shown that for a set S of n pairwise disjoint axis-parallel line segments in the plane there is a simple alternating path of length ( n). This bound is best possible in the...
STACS
2010
Springer
14 years 5 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
ICDCSW
2011
IEEE
12 years 10 months ago
2011
IEEE
—Computer systems often reach a point at which the relative cost to increase some tunable parameter is no longer worth the corresponding performance benefit. These “knees” t...
GLOBECOM
2007
IEEE
14 years 5 months ago
2007
IEEE
— In contrast to aggregate inter-packet metrics that quantify the arrival processes of aggregate traffic at a single point in the network, intraflow end-to-end per-packet perform...