Sciweavers

ESA
2009
Springer
143views Algorithms» more  ESA 2009»
14 years 3 months ago
On Optimally Partitioning a Text to Improve Its Compression
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...
Paolo Ferragina, Igor Nitto, Rossano Venturini
ESA
2009
Springer
124views Algorithms» more  ESA 2009»
14 years 3 months ago
Minimum Makespan Multi-vehicle Dial-a-Ride
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,...
Inge Li Gørtz, Viswanath Nagarajan, R. Ravi
ESA
2009
Springer
151views Algorithms» more  ESA 2009»
14 years 3 months ago
Experimental Study of FPT Algorithms for the Directed Feedback Vertex Set Problem
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...
Rudolf Fleischer, Xi Wu, Liwei Yuan
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 3 months ago
Sparse Cut Projections in Graph Streams
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...
Atish Das Sarma, Sreenivas Gollapudi, Rina Panigra...
ESA
2009
Springer
156views Algorithms» more  ESA 2009»
14 years 3 months ago
On Revenue Maximization in Second-Price Ad Auctions
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...
Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, ...
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
14 years 3 months ago
Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem
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...
Dániel Marx, Igor Razgon
ESA
2009
Springer
116views Algorithms» more  ESA 2009»
14 years 3 months ago
On the Expansion and Diameter of Bluetooth-Like Topologies
Alberto Pettarin, Andrea Pietracaprina, Geppino Pu...
ESA
2009
Springer
98views Algorithms» more  ESA 2009»
14 years 3 months ago
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
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...
Christoph Dürr, Flavio Guiñez, Mart&ia...
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
14 years 3 months ago
Iterative Rounding for Multi-Objective Optimization Problems
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...
Fabrizio Grandoni, R. Ravi, Mohit Singh