Approximation and Online Algorithms - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 15)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783030808785, 9783030808792

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A Constant-Factor Approximation Algorithm for Red-Blue Set Cover with Unit Disks

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-030-80879-2_14 ◽

2021 ◽

pp. 204-219

Author(s):

Raghunath Reddy Madireddy ◽

Apurva Mudgal

Keyword(s):

Approximation Algorithm ◽

Constant Factor ◽

Set Cover ◽

Unit Disks

Download Full-text

Online Coloring and a New Type of Adversary for Online Graph Problems

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-030-80879-2_4 ◽

2021 ◽

pp. 47-62

Author(s):

Yaqiao Li ◽

Vishnu V. Narayan ◽

Denis Pankratov

Keyword(s):

Graph Problems ◽

New Type ◽

Online Coloring

Download Full-text

Lasserre Integrality Gaps for Graph Spanners and Related Problems

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-030-80879-2_7 ◽

2021 ◽

pp. 97-112

Author(s):

Michael Dinitz ◽

Yasamin Nazari ◽

Zeyu Zhang

Keyword(s):

Graph Spanners ◽

Integrality Gaps

Download Full-text

2-Node-Connectivity Network Design

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-030-80879-2_15 ◽

2021 ◽

pp. 220-235

Author(s):

Zeev Nutov

Keyword(s):

Network Design ◽

Node Connectivity

Download Full-text

An Improved Approximation Algorithm for the Uniform Cost-Distance Steiner Tree Problem

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-030-80879-2_13 ◽

2021 ◽

pp. 189-203

Author(s):

Ardalan Khazraei ◽

Stephan Held

Keyword(s):

Approximation Algorithm ◽

Steiner Tree ◽

Steiner Tree Problem ◽

Cost Distance

Download Full-text

Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-030-80879-2_10 ◽

2021 ◽

pp. 143-158

Author(s):

Dimitris Christou ◽

Dimitris Fotakis ◽

Grigorios Koumoutsos

Keyword(s):

Server Problem

Download Full-text

Concave Connection Cost Facility Location and the Star Inventory Routing Problem

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-030-80879-2_12 ◽

2021 ◽

pp. 174-188

Author(s):

Jarosław Byrka ◽

Mateusz Lewandowski

Keyword(s):

Facility Location ◽

Inventory Routing ◽

Routing Problem ◽

Inventory Routing Problem ◽

Connection Cost

Download Full-text

Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-030-80879-2_11 ◽

2021 ◽

pp. 159-173

Author(s):

Magnús M. Halldórsson ◽

Guy Kortsarz ◽

Marek Cygan

Keyword(s):

Set Cover ◽

Time Approximation ◽

Subexponential Time

Download Full-text

Distributed Algorithms for Matching in Hypergraphs

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-030-80879-2_3 ◽

2021 ◽

pp. 30-46

Author(s):

Oussama Hanguir ◽

Clifford Stein

Keyword(s):

Distributed Algorithms

Download Full-text

LP-Based Algorithms for Multistage Minimization Problems

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-030-80879-2_1 ◽

2021 ◽

pp. 1-15

Author(s):

Evripidis Bampis ◽

Bruno Escoffier ◽

Alexander Kononov

Keyword(s):

Minimization Problems

Download Full-text

Approximation and Online Algorithms - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

A Constant-Factor Approximation Algorithm for Red-Blue Set Cover with Unit Disks

Online Coloring and a New Type of Adversary for Online Graph Problems

Lasserre Integrality Gaps for Graph Spanners and Related Problems

2-Node-Connectivity Network Design

An Improved Approximation Algorithm for the Uniform Cost-Distance Steiner Tree Problem

Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics

Concave Connection Cost Facility Location and the Star Inventory Routing Problem

Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems

Distributed Algorithms for Matching in Hypergraphs

LP-Based Algorithms for Multistage Minimization Problems

Approximation and Online Algorithms - Lecture Notes in Computer Science
Latest Publications