112 search results - page 23 / 23 » Constant factor approximation of vertex-cuts in planar graph... |
ESA
2009
Springer
14 years 5 days ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
ESA
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...