Sciweavers

26 search results - page 3 / 6
» approx 2004
Sort
View
APPROX
2004
Springer
120views Algorithms» more  APPROX 2004»
14 years 26 days ago
Simultaneous Source Location
We consider the problem of Simultaneous Source Location – selecting locations for sources in a capacitated graph such that a given set of demands can be satisfied. We give an ex...
Konstantin Andreev, Charles Garrod, Bruce M. Maggs...
APPROX
2004
Springer
108views Algorithms» more  APPROX 2004»
14 years 26 days ago
Estimating Frequency Moments of Data Streams Using Random Linear Combinations
The problem of estimating the kth frequency moment Fk for any nonnegative k, over a data stream by looking at the items exactly once as they arrive, was considered in a seminal pap...
Sumit Ganguly
APPROX
2004
Springer
179views Algorithms» more  APPROX 2004»
14 years 26 days ago
Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz
APPROX
2004
Springer
113views Algorithms» more  APPROX 2004»
14 years 26 days ago
Computationally-Feasible Truthful Auctions for Convex Bundles
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...
Moshe Babaioff, Liad Blumrosen
APPROX
2004
Springer
149views Algorithms» more  APPROX 2004»
14 years 26 days ago
Edge Coloring with Delays
Consider the following communication problem, that leads to a new notion of edge coloring. The communication network is represented by a bipartite multigraph, where the nodes on o...
Noga Alon, Vera Asodi