Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
APPROX
2009
Springer
107views Algorithms» more  APPROX 2009»
10 years 8 months ago
Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs
We consider the problem of aligned coloring of interval and chordal graphs. These problems have substantial applications to register allocation in compilers and have recently been ...
Douglas E. Carroll, Adam Meyerson, Brian Tagiku
APPROX
2009
Springer
96views Algorithms» more  APPROX 2009»
10 years 8 months ago
On the Optimality of Gluing over Scales
We show that for every α > 0, there exist n-point metric spaces (X, d) where every “scale” admits a Euclidean embedding with distortion at most α, but the whole space req...
Alexander Jaffe, James R. Lee, Mohammad Moharrami
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
10 years 8 months ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
APPROX
2009
Springer
104views Algorithms» more  APPROX 2009»
10 years 8 months ago
Improved Polynomial Identity Testing for Read-Once Formulas
An arithmetic read-once formula (ROF for short) is a formula (a circuit whose underlying graph is a tree) in which the operations are {+, ×} and such that every input variable la...
Amir Shpilka, Ilya Volkovich
APPROX
2009
Springer
85views Algorithms» more  APPROX 2009»
10 years 8 months ago
Pseudorandom Generators and Typically-Correct Derandomization
The area of derandomization attempts to provide efficient deterministic simulations of randomized algorithms in various algorithmic settings. Goldreich and Wigderson introduced a n...
Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel
APPROX
2009
Springer
87views Algorithms» more  APPROX 2009»
10 years 8 months ago
Pseudorandom Bit Generators That Fool Modular Sums
Shachar Lovett, Omer Reingold, Luca Trevisan, Sali...
APPROX
2009
Springer
99views Algorithms» more  APPROX 2009»
10 years 8 months ago
Resource Minimization Job Scheduling
Abstract. Given a set J of jobs, where each job j is associated with release date rj, deadline dj and processing time pj, our goal is to schedule all jobs using the minimum possibl...
Julia Chuzhoy, Paolo Codenotti
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
10 years 8 months ago
Truthful Mechanisms via Greedy Iterative Packing
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
Chandra Chekuri, Iftah Gamzu
APPROX
2009
Springer
93views Algorithms» more  APPROX 2009»
10 years 8 months ago
PASS Approximation
Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, ...
books