Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540651420, 9783540495437

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

An Algorithmic Embedding of Graphs via Perfect Matchings

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-49543-6_3 ◽

1998 ◽

pp. 25-34 ◽

Cited By ~ 3

Author(s):

Vojtech Rödl ◽

Andrzej Ruciński ◽

Michelle Wagner

Keyword(s):

Perfect Matchings

Download Full-text

On-line Bin-Stretching

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-49543-6_7 ◽

1998 ◽

pp. 71-81 ◽

Cited By ~ 11

Author(s):

Yossi Azar ◽

Oded Regev

Keyword(s):

On Line ◽

Bin Stretching

Download Full-text

Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-49543-6_28 ◽

1998 ◽

pp. 357-368 ◽

Cited By ~ 1

Author(s):

Gunnar Andersson ◽

Lars Engebretsen

Keyword(s):

Sampling Methods ◽

Optimization Problems ◽

Boolean Optimization

Download Full-text

Robotic Exploration, Brownian Motion and Electrical Resistance

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-49543-6_10 ◽

1998 ◽

pp. 116-130 ◽

Cited By ~ 9

Author(s):

Israel A. Wagner ◽

Michael Lindenbaum ◽

Alfred M. Bruckstein

Keyword(s):

Brownian Motion ◽

Electrical Resistance ◽

Robotic Exploration

Download Full-text

A Role of Constraint in Self-Organization

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-49543-6_24 ◽

1998 ◽

pp. 307-318 ◽

Cited By ~ 2

Author(s):

Carlos Domingo ◽

Osamu Watanabe ◽

Tadashi Yamazaki

Keyword(s):

Self Organization

Download Full-text

Parallel Random Search and Tabu Search for the Minimal Consistent Subset Selection Problem

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-49543-6_20 ◽

1998 ◽

pp. 248-259 ◽

Cited By ~ 6

Author(s):

Vicente Cerverón ◽

Ariadna Fuertes

Keyword(s):

Tabu Search ◽

Random Search ◽

Subset Selection ◽

Selection Problem ◽

Consistent Subset

Download Full-text

Talagrand’s Inequality and Locality in Distributed Computing

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-49543-6_6 ◽

1998 ◽

pp. 60-70

Author(s):

Devdatt P. Dubhashi

Keyword(s):

Distributed Computing ◽

Talagrand’S Inequality

Download Full-text

Deterministic Hypergraph Coloring and Its Applications

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-49543-6_4 ◽

1998 ◽

pp. 35-46 ◽

Cited By ~ 7

Author(s):

Chi-Jen Lu

Keyword(s):

Hypergraph Coloring

Download Full-text

The “Burnside Process” Converges Slowly

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-49543-6_26 ◽

1998 ◽

pp. 331-345

Author(s):

Leslie Ann Goldberg ◽

Mark Jerrum

Download Full-text

A Derandomization Using Min-Wise Independent Permutations

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-49543-6_2 ◽

1998 ◽

pp. 15-24 ◽

Cited By ~ 7

Author(s):

Andrei Z. Broder ◽

Moses Charikar ◽

Michael Mitzenmacher

Download Full-text

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

An Algorithmic Embedding of Graphs via Perfect Matchings

On-line Bin-Stretching

Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems

Robotic Exploration, Brownian Motion and Electrical Resistance

A Role of Constraint in Self-Organization

Parallel Random Search and Tabu Search for the Minimal Consistent Subset Selection Problem

Talagrand’s Inequality and Locality in Distributed Computing

Deterministic Hypergraph Coloring and Its Applications

The “Burnside Process” Converges Slowly

A Derandomization Using Min-Wise Independent Permutations

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science
Latest Publications