Sciweavers

4781 search results - page 85 / 957
» Online algorithms for network design
Sort
View
SAGT
2010
Springer
223views Game Theory» more  SAGT 2010»
14 years 12 months ago
Improved Lower Bounds on the Price of Stability of Undirected Network Design Games
Abstract. Bounding the price of stability of undirected network design games with fair cost allocation is a challenging open problem in the Algorithmic Game Theory research agenda....
Vittorio Bilò, Ioannis Caragiannis, Angelo ...
ODR
2008
15 years 2 months ago
Re-Consider: The Integration of Online Dispute Resolution and Decision Support Systems
Current approaches for the design of Online Dispute Resolution (ODR) systems involve the replication of Alternative Dispute Resolution practices such as mediation and negotiation. ...
Nial Muecke, Andrew Stranieri, Charlynn Miller
JSAC
2008
73views more  JSAC 2008»
15 years 1 months ago
Quasi-Dynamic Network Design Considering Different Service Holding Times
Abstract-- We propose a quasi-dynamic network design algorithm considering traffic growth in multi-layered photonic networks that consist of electrical paths and optical paths. The...
Koichi Kanie, Hiroshi Hasegawa, Ken-ichi Sato
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
16 years 1 months ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
IPPS
2007
IEEE
15 years 7 months ago
A Scalable Cluster Algorithm for Internet Resources
Applications such as parallel computing, online games, and content distribution networks need to run on a set of resources with particular network connection characteristics to ge...
Chuang Liu, Ian T. Foster