Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540663294, 9783540484134

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Scheduling with Unexpected Machine Breakdowns

Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/978-3-540-48413-4_27 ◽

1999 ◽

pp. 269-280 ◽

Cited By ~ 2

Author(s):

Susanne Albers ◽

Günter Schmidt

Keyword(s):

Machine Breakdowns

Download Full-text

Randomized Rounding for Semidefinite Programs – Variations on the MAX CUT Example

Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/978-3-540-48413-4_20 ◽

1999 ◽

pp. 189-196 ◽

Cited By ~ 4

Author(s):

Uriel Feige

Keyword(s):

Randomized Rounding ◽

Semidefinite Programs

Download Full-text

Improved Derandomization of BPP Using a Hitting Set Generator

Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/978-3-540-48413-4_14 ◽

1999 ◽

pp. 131-137 ◽

Cited By ~ 8

Author(s):

Oded Goldreich ◽

Avi Wigderson

Keyword(s):

Hitting Set

Download Full-text

Probabilistic and Deterministic Approximations of the Permanent

Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/978-3-540-48413-4_13 ◽

1999 ◽

pp. 130-130

Author(s):

Avi Wigderson

Download Full-text

Efficient Redundant Assignments under Fault-Tolerance Constraints

Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/978-3-540-48413-4_17 ◽

1999 ◽

pp. 156-167

Author(s):

Dimitris A. Fotakis ◽

Paul G. Spirakis

Keyword(s):

Fault Tolerance

Download Full-text

A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest

Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/978-3-540-48413-4_24 ◽

1999 ◽

pp. 233-244 ◽

Cited By ~ 4

Author(s):

Seth Pettie ◽

Vijaya Ramachandran

Keyword(s):

Parallel Algorithm ◽

Spanning Forest ◽

Time Work ◽

Minimum Spanning Forest

Download Full-text

Independent Sets in Hypergraphs with Applications to Routing Via Fixed Paths

Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/978-3-540-48413-4_3 ◽

1999 ◽

pp. 16-27 ◽

Cited By ~ 8

Author(s):

Noga Alon ◽

Uri Arad ◽

Yossi Azar

Keyword(s):

Independent Sets

Download Full-text

Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets

Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/978-3-540-48413-4_15 ◽

1999 ◽

pp. 138-143

Author(s):

Andreas Baltz ◽

Tomasz Schoen ◽

Anand Srivastav

Keyword(s):

Sidon Sets ◽

Probabilistic Construction ◽

Free Sets

Download Full-text

Approximation of Multi-Color Discrepancy

Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/978-3-540-48413-4_5 ◽

1999 ◽

pp. 39-50 ◽

Cited By ~ 3

Author(s):

Benjamin Doerr ◽

Anand Srivastav

Download Full-text

Hardness Results for the Power Range Assignment Problem in Packet Radio Networks

Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/978-3-540-48413-4_21 ◽

1999 ◽

pp. 197-208 ◽

Cited By ~ 62

Author(s):

Andrea E. F. Clementi ◽

Paolo Penna ◽

Riccardo Silvestri

Keyword(s):

Assignment Problem ◽

Radio Networks ◽

Packet Radio Networks ◽

Packet Radio ◽

Range Assignment

Download Full-text

Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Scheduling with Unexpected Machine Breakdowns

Randomized Rounding for Semidefinite Programs – Variations on the MAX CUT Example

Improved Derandomization of BPP Using a Hitting Set Generator

Probabilistic and Deterministic Approximations of the Permanent

Efficient Redundant Assignments under Fault-Tolerance Constraints

A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest

Independent Sets in Hypergraphs with Applications to Routing Via Fixed Paths

Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets

Approximation of Multi-Color Discrepancy

Hardness Results for the Power Range Assignment Problem in Packet Radio Networks

Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science
Latest Publications