111 search results - page 7 / 23 » The Hamiltonian p-Median Problem |
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
— We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we sh...
116
Voted
GC
2007
Springer
15 years 19 days ago
2007
Springer
For an integer k > 0, a graph G is k-triangular if every edge of G lies in at least k distinct 3-cycles of G. In (J Graph Theory 11:399–407 (1987)), Broersma and Veldman propo...
MPC
1998
Springer
15 years 4 months ago
1998
Springer
43
Voted
DAM
2006
15 years 22 days ago
2006
151
Voted
DAM
2011
14 years 7 months ago
2011
This paper considers a single-vehicle Dial-a-Ride problem in which customers may experience stochastic delays at their pickup locations. If a customer is absent when the vehicle s...