Sciweavers

Share
APPROX
2009
Springer
105views Algorithms» more  APPROX 2009»
9 years 9 months ago
Real-Time Message Routing and Scheduling
Abstract. Exchanging messages between nodes of a network (e.g., embedded computers) is a fundamental issue in real-time systems involving critical routing and scheduling decisions....
Ronald Koch, Britta Peis, Martin Skutella, Andreas...
APPROX
2009
Springer
107views Algorithms» more  APPROX 2009»
10 years 3 months ago
Extractors Using Hardness Amplification
Anindya De, Luca Trevisan
APPROX
2009
Springer
139views Algorithms» more  APPROX 2009»
10 years 6 months ago
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
Chandra Chekuri, Alina Ene, Nitish Korula
APPROX
2009
Springer
195views Algorithms» more  APPROX 2009»
10 years 6 months ago
Approximating Node-Connectivity Augmentation Problems
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
Zeev Nutov
APPROX
2009
Springer
163views Algorithms» more  APPROX 2009»
10 years 6 months ago
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
José R. Correa, Martin Skutella, José...
APPROX
2009
Springer
156views Algorithms» more  APPROX 2009»
10 years 6 months ago
An Analysis of Random-Walk Cuckoo Hashing
In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion time for cuckoo hashing under the random-walk insertion method. Cuckoo hashing ...
Alan M. Frieze, Páll Melsted, Michael Mitze...
APPROX
2009
Springer
135views Algorithms» more  APPROX 2009»
10 years 6 months ago
Tolerant Linearity Testing and Locally Testable Codes
Abstract. We study tolerant linearity testing under general distributions. Given groups G and H, a distribution µ on G, and oracle access to a function f : G → H, we consider th...
Swastik Kopparty, Shubhangi Saraf
APPROX
2009
Springer
98views Algorithms» more  APPROX 2009»
10 years 6 months ago
Random Tensors and Planted Cliques
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
S. Charles Brubaker, Santosh Vempala
APPROX
2009
Springer
145views Algorithms» more  APPROX 2009»
10 years 6 months ago
Approximating Some Network Design Problems with Node Costs
We study several multi-criteria undirected network design problems with node costs and lengths. All these problems are related to the Multicommodity Buy at Bulk (MBB) problem in w...
Guy Kortsarz, Zeev Nutov
APPROX
2009
Springer
149views Algorithms» more  APPROX 2009»
10 years 6 months ago
On the Complexity of the Asymmetric VPN Problem
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
Thomas Rothvoß, Laura Sanità
books