706 search results - page 18 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
CATA
2004
13 years 9 months ago
2004
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
Many measurement systems have been proposed in recent years to shed light on the internal performance of the Internet. Their common goal is to allow distributed applications to imp...
ANOR
2008
13 years 7 months ago
2008
We describe a class of problems motivated by numerous real-world applications where there is a collection of objects that have both a cost and a value, but where some of those obj...
WG
2010
Springer
13 years 5 months ago
2010
Springer
Eulerian extension problems aim at making a given (directed) (multi-)graph Eulerian by adding a minimum-cost set of edges (arcs). These problems have natural applications in schedu...
DCOSS
2007
Springer
13 years 11 months ago
2007
Springer
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...