Sciweavers

110
Voted
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
16 years 26 days ago
Utilitarian Mechanism Design for Multi-Objective Optimization
Fabrizio Grandoni, Piotr Krysta, Stefano Leonardi,...
SODA
2010
ACM
157views Algorithms» more  SODA 2010»
16 years 26 days ago
Testing monotone high-dimensional distributions
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
Ronitt Rubinfeld, Rocco A. Servedio
171
Voted
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
16 years 26 days ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
83
Voted
SODA
2010
ACM
140views Algorithms» more  SODA 2010»
16 years 26 days ago
Vertices of Degree k in Random Maps
Daniel Johannsen, Konstantinos Panagiotou
120
Voted
SODA
2010
ACM
151views Algorithms» more  SODA 2010»
16 years 26 days ago
A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information ove...
S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari
116
Voted
SODA
2010
ACM
173views Algorithms» more  SODA 2010»
16 years 26 days ago
Distributed Agreement with Optimal Communication Complexity
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
Seth Gilbert, Dariusz Kowalski
131
Voted
SODA
2010
ACM
234views Algorithms» more  SODA 2010»
16 years 26 days ago
PTAS for maximum weight independent set problem with random weights in bounded degree graphs
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...
David Gamarnik, David Goldberg, Theophane Weber
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
16 years 26 days ago
A deterministic truthful PTAS for scheduling related machines
George Christodoulou, Annamaria Kovacs
94
Voted
SODA
2010
ACM
162views Algorithms» more  SODA 2010»
16 years 26 days ago
Fast distance multiplication of unit-Monge matrices
Alexander Tiskin
97
Voted
SODA
2010
ACM
224views Algorithms» more  SODA 2010»
16 years 26 days ago
Reconstructing approximate phylogenetic trees from quartet samples
Sagi Snir, Raphael Yuster