448 search results - page 35 / 90 » Fast Approximation Algorithms for Multicommodity Flow Proble... |
SIAMIS
2011
13 years 2 months ago
2011
Abstract. Accurate signal recovery or image reconstruction from indirect and possibly undersampled data is a topic of considerable interest; for example, the literature in the rece...
APPROX
2010
Springer
13 years 9 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...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3list-coloring. Our algorithms are based on a constraint satisfaction...
SECON
2010
IEEE
13 years 5 months ago
2010
IEEE
Nodes in a cognitive radio mesh network may select from a set of available channels to use provided they do not interfere with primary users. This ability can improve overall netwo...
ICDE
2002
IEEE
14 years 9 months ago
2002
IEEE
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...