APPROX
2009
Springer
14 years 6 months ago
2009
Springer
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...
APPROX
2009
Springer
14 years 6 months ago
2009
Springer
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...
APPROX
2009
Springer
14 years 6 months ago
2009
Springer
The area of derandomization attempts to provide efficient deterministic simulations of randomized algorithms in various algorithmic settings. Goldreich and Wigderson introduced a n...
APPROX
2009
Springer
14 years 6 months ago
2009
Springer
APPROX
2009
Springer
14 years 6 months ago
2009
Springer
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...
APPROX
2009
Springer
14 years 6 months ago
2009
Springer
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 ...
APPROX
2009
Springer
14 years 6 months ago
2009
Springer
APPROX
2009
Springer
14 years 6 months ago
2009
Springer
APPROX
2009
Springer
14 years 6 months ago
2009
Springer
APPROX
2009
Springer
14 years 6 months ago
2009
Springer
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...