Sciweavers

841 search results - page 15 / 169
» Approximability of Minimum AND-Circuits
Sort
View
FOCS
2010
IEEE
13 years 5 months ago
Minimum-Cost Network Design with (Dis)economies of Scale
Given a network, a set of demands and a cost function f(
Matthew Andrews, Spyridon Antonakopoulos, Lisa Zha...
CORR
2010
Springer
122views Education» more  CORR 2010»
13 years 7 months ago
Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency Problems
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened ...
Deeparnab Chakrabarty, Chaitanya Swamy
CIAC
2006
Springer
100views Algorithms» more  CIAC 2006»
13 years 11 months ago
Distributed Approximation Algorithms for Planar Graphs
In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximat...
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szyman...
MICS
2010
137views more  MICS 2010»
13 years 6 months ago
Finding Range Minima in the Middle: Approximations and Applications
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
Johannes Fischer, Volker Heun
TCS
2010
13 years 2 months ago
Maximizing the minimum load for selfish agents
We consider the problem of maximizing the minimum load for machines that are controlled by selfish agents, who are only interested in maximizing their own profit. Unlike the class...
Leah Epstein, Rob van Stee