Sciweavers

60 search results - page 1 / 12
» The Structure and Number of Global Roundings of a Graph
Sort
View
COCOON
2003
Springer
14 years 20 days ago
The Structure and Number of Global Roundings of a Graph
Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi T...
SIROCCO
2008
13 years 9 months ago
Self-stabilizing Cuts in Synchronous Networks
Consider a synchronized distributed system where each node can only observe the state of its neighbors. Such a system is called selfstabilizing if it reaches a stable global state ...
Thomas Sauerwald, Dirk Sudholt
SODA
2008
ACM
93views Algorithms» more  SODA 2008»
13 years 9 months ago
Fast load balancing via bounded best response
It is known that the dynamics of best response in an environment of non-cooperative users may converge to a good solution when users play sequentially, but may cycle far away from...
Baruch Awerbuch, Yossi Azar, Rohit Khandekar
CORR
2011
Springer
215views Education» more  CORR 2011»
12 years 11 months ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
SIAMDM
2000
103views more  SIAMDM 2000»
13 years 7 months ago
Directional Routing via Generalized st-Numberings
We present a mathematical model for network routing based on generating paths in a consistent direction. Our development is based on an algebraic and geometric framework for defini...
Fred S. Annexstein, Kenneth A. Berman