ESA
2009
Springer
14 years 6 months ago
2009
Springer
In this paper we investigate the problem of partitioning an input string T in such a way that compressing individually its parts via a basecompressor C gets a compressed output th...
ESA
2009
Springer
14 years 6 months ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
ESA
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. We evaluate the performance of FPT algorithms for the directed feedback vertex set problem (DFVS). We propose several new data reduction rules for DFVS. which can signi...
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...