653 search results - page 53 / 131 » The size of minimum 3-trees |
100
click to vote
COMPGEOM
1991
ACM
15 years 3 months ago
1991
ACM
Given a simple polygon in the plane with two distinguished vertices, s and g, is it possible for two guards to simultaneously walk along the two boundary chains from s to g in suc...
APPINF
2003
15 years 1 months ago
2003
In this paper we present optimum interval routing algorithms for message passing networks that have topological structure defined by k-caterpillars and maximal outer planar graph...
SODA
2001
ACM
15 years 1 months ago
2001
ACM
We introduce a new updatable representation ofbinary trees. The structure requires the information theoretic minimum 2n + o(n) bits and supports basic navigational operations in c...
111
click to vote
ALGORITHMICA
2010
14 years 12 months ago
2010
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are ...