4438 search results - page 836 / 888 » The Case for Collaborative Programming |
102
click to vote
STOC
2003
ACM
16 years 3 days ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
STOC
2002
ACM
16 years 3 days ago
2002
ACM
We investigate the price of selfish routing in non-cooperative networks in terms of the coordination and bicriteria ratios in the recently introduced game theoretic network model ...
100
click to vote
OSDI
2006
ACM
16 years 3 days ago
2006
ACM
Storage systems such as file systems, databases, and RAID systems have a simple, basic contract: you give them data, they do not lose or corrupt it. Often they store the only copy...
ICALP
2009
Springer
16 years 3 days ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
120
click to vote
ICALP
2009
Springer
16 years 3 days ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...