206 search results - page 33 / 42 » Constant factor approximation algorithm for the knapsack med... |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
PODC
2005
ACM
14 years 1 months ago
2005
ACM
A quorum system is a family of sets (themselves called quorums), each pair of which intersect. In many distributed algorithms, the basic unit accessed by a client is a quorum of n...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
ICALP
2003
Springer
14 years 21 days ago
2003
Springer
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...