3678 search results - page 122 / 736 » On the Stable Paths Problem |
102
Voted
APPROX
2010
Springer
15 years 2 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
93
Voted
CORR
2008
Springer
15 years 27 days ago
2008
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
120
Voted
SENSYS
2003
ACM
15 years 6 months ago
2003
ACM
Sensor networks not only have the potential to change the way we use, interact with, and view computers, but also the way we use, interact with, and view the world around us. In o...
ICCAD
2006
IEEE
15 years 9 months ago
2006
IEEE
Process variations cause different behavior of timingdependent effects across different chips. In this work, we analyze one example of timing-dependent effects, crosscoupling ...
117
click to vote
ALGORITHMICA
2006
15 years 26 days ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...