Sciweavers

241 search results - page 32 / 49
» Degree Bounded Spanning Trees
Sort
View
IPPS
2010
IEEE
13 years 5 months ago
A scalable algorithm for maintaining perpetual system connectivity in dynamic distributed systems
We investigate the problem of maintaining a topology with small degree as well as small diameter in a dynamic distributed system such that the system always stays connected and pr...
Tarun Bansal, Neeraj Mittal
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
COCO
2005
Springer
72views Algorithms» more  COCO 2005»
14 years 28 days ago
Toward a Model for Backtracking and Dynamic Programming
We propose a model called priority branching trees (pBT ) for backtracking and dynamic programming algorithms. Our model generalizes both the priority model of Borodin, Nielson an...
Michael Alekhnovich, Allan Borodin, Joshua Buresh-...
COCOON
2006
Springer
13 years 11 months ago
Approximating Min-Max (Regret) Versions of Some Polynomial Problems
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
FOCS
2009
IEEE
14 years 2 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...