ESA
2009
Springer
14 years 6 months ago
2009
Springer
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
ESA
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...
ESA
2009
Springer
14 years 6 months ago
2009
Springer
ESA
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...
ESA
2009
Springer
14 years 6 months ago
2009
Springer
ESA
2009
Springer
14 years 6 months ago
2009
Springer
We consider the problem of coloring a grid using k colors with the restriction that in each row and each column has an specific number of cells of each color. In an already classi...
ESA
2009
Springer
14 years 6 months ago
2009
Springer
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
ESA
2009
Springer
14 years 6 months ago
2009
Springer
The study of hashing is closely related to the analysis of balls and bins; items are hashed to memory locations much as balls are thrown into bins. In particular, Azar et. al. [2] ...
ESA
2009
Springer
14 years 6 months ago
2009
Springer
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
ESA
2009
Springer
14 years 6 months ago
2009
Springer
We consider online algorithms for pull-based broadcast scheduling. In this setting there are n pages of information at a server and requests for pages arrive online. When the serv...