565 search results - page 29 / 113 » Geometry of Upper Probabilities |
106
click to vote
CAAN
2006
Springer
15 years 3 months ago
2006
Springer
In this paper we improve the quality of a recently suggested class of construction heuristics for the Asymmetric Traveling Salesman Problem (ATSP), namely the Contract-or-Patch heu...
COMPGEOM
1991
ACM
15 years 3 months ago
1991
ACM
We provide new combinatorial bounds on the complexity of a face in an arrangement of segments in the plane. In particular, we show that the complexity of a single face in an arran...
106
click to vote
COMPGEOM
2010
ACM
15 years 3 months ago
2010
ACM
Let C be a family of n convex bodies in the plane, which can be decomposed into k subfamilies of pairwise disjoint sets. It is shown that the number of tangencies between the memb...
COMPGEOM
2005
ACM
15 years 1 months ago
2005
ACM
Order Type Extension and New Results ectilinear Crossing Number - Extended Abstract Oswin Aichholzer∗ Hannes Krasser† We provide a complete data base of all realizable order t...
PODC
2005
ACM
15 years 5 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...