279 search results - page 50 / 56 » Matching Polynomials And Duality |
INFOCOM
2003
IEEE
14 years 26 days ago
2003
IEEE
Abstract— We explore the problem of routing bandwidth guaranteed paths in wavelength-routed, WDM optical mesh networks. A WDM mesh network offers great flexibility in dynamicall...
CRYPTO
2001
Springer
14 years 2 days ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
This paper considers two similar graph algorithms that work by repeatedly increasing "flow" along "augmenting paths": the Ford-Fulkerson algorithm for the maxi...
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
4OR
2010
13 years 7 months ago
2010
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...