1327 search results - page 92 / 266 » Path following algorithm for the graph matching problem |
95
Voted
COCOA
2008
Springer
15 years 3 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
ICRA
1998
IEEE
15 years 6 months ago
1998
IEEE
This paper studies motion planning from one zero velocity state to another for a three-joint robot in a horizontal plane witha passive revolute third joint. Such a robot is small-...
CONEXT
2008
ACM
15 years 3 months ago
2008
ACM
In peer-to-peer (P2P) systems, a receiver needs to be matched with multiple senders, because peers have limited capacity and reliability. Efficient peer matching can reduce the co...
108
Voted
APPROX
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
207
Voted
VLDB
2007
ACM
16 years 2 months ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...