Approximation Algorithms for Combinatorial Optimization - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540679967, 9783540444367

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Variable Length Sequencing with Two Lengths

Approximation Algorithms for Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/3-540-44436-x_7 ◽

2000 ◽

pp. 51-59

Author(s):

Piotr Berman ◽

Junichiro Fukuyama

Keyword(s):

Variable Length

Download Full-text

Scheduling under Uncertainty: Optimizing against a Randomizing Adversary

Approximation Algorithms for Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/3-540-44436-x_3 ◽

2000 ◽

pp. 15-26 ◽

Cited By ~ 20

Author(s):

Rolf H. Möhring

Keyword(s):

Scheduling Under Uncertainty

Download Full-text

An Approximation Algorithm for MAX DICUT with Given Sizes of Parts

Approximation Algorithms for Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/3-540-44436-x_5 ◽

2000 ◽

pp. 34-41 ◽

Cited By ~ 2

Author(s):

Alexander Ageev ◽

Refael Hassin ◽

Maxim Sviridenko

Keyword(s):

Approximation Algorithm

Download Full-text

On the Relative Complexity of Approximate Counting Problems

Approximation Algorithms for Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/3-540-44436-x_12 ◽

2000 ◽

pp. 108-119 ◽

Cited By ~ 9

Author(s):

Martin Dyer ◽

Leslie Ann Goldberg ◽

Catherine Greenhill ◽

Mark Jerrum

Keyword(s):

Approximate Counting ◽

Counting Problems ◽

Relative Complexity

Download Full-text

An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem

Approximation Algorithms for Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/3-540-44436-x_18 ◽

2000 ◽

pp. 177-182 ◽

Cited By ~ 3

Author(s):

Jain Kamal ◽

Vijay V. Vazirani

Keyword(s):

Approximation Algorithm ◽

Facility Location ◽

Location Problem ◽

Fault Tolerant ◽

Facility Location Problem

Download Full-text

Approximation Algorithms for a Capacitated Network Design Problem

Approximation Algorithms for Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/3-540-44436-x_17 ◽

2000 ◽

pp. 167-176 ◽

Cited By ~ 13

Author(s):

R. Hassin ◽

R. Ravi ◽

F. S. Salman

Keyword(s):

Approximation Algorithms ◽

Network Design ◽

Design Problem ◽

Network Design Problem ◽

Capacitated Network ◽

Capacitated Network Design

Download Full-text

Rectangle Tiling

Approximation Algorithms for Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/3-540-44436-x_21 ◽

2000 ◽

pp. 206-213 ◽

Cited By ~ 3

Author(s):

Krzysztof Loryś ◽

Katarzyna Paluch

Download Full-text

Factor 4/3 Approximations for Minimum 2-Connected Subgraphs

Approximation Algorithms for Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/3-540-44436-x_26 ◽

2000 ◽

pp. 262-273 ◽

Cited By ~ 16

Author(s):

Santosh Vempala ◽

Adrian Vetta

Keyword(s):

Connected Subgraphs

Download Full-text

New Results for Online Page Replication

Approximation Algorithms for Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/3-540-44436-x_15 ◽

2000 ◽

pp. 144-154 ◽

Cited By ~ 9

Author(s):

Rudolf Fleischer ◽

Steve Seiden

Download Full-text

On the Hardness of Approximating NP Witnesses

Approximation Algorithms for Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/3-540-44436-x_13 ◽

2000 ◽

pp. 120-131 ◽

Cited By ~ 6

Author(s):

Uriel Feige ◽

Michael Langberg ◽

Kobbi Nissim

Download Full-text

Approximation Algorithms for Combinatorial Optimization - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Variable Length Sequencing with Two Lengths

Scheduling under Uncertainty: Optimizing against a Randomizing Adversary

An Approximation Algorithm for MAX DICUT with Given Sizes of Parts

On the Relative Complexity of Approximate Counting Problems

An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem

Approximation Algorithms for a Capacitated Network Design Problem

Rectangle Tiling

Factor 4/3 Approximations for Minimum 2-Connected Subgraphs

New Results for Online Page Replication

On the Hardness of Approximating NP Witnesses

Approximation Algorithms for Combinatorial Optimization - Lecture Notes in Computer Science
Latest Publications