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

9783540441861, 9783540457534

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Non-abusiveness Helps: An % MathType!MTEF!2!1!+- % feaafiart1ev1aaatCvAUfKttLearuqr1ngBPrgarmWu51MyVXgatC % vAUfeBSjuyZL2yd9gzLbvyNv2CaeHbuLwBLnhiov2DGi1BTfMBaeHb % d9wDYLwzYbItLDharqqtubsr4rNCHbGeaGqiVu0Je9sqqrpepC0xbb % L8F4rqqrFfpeea0xe9Lq-Jc9vqaqpepm0xbba9pwe9Q8fs0-yqaqpe % pae9pg0FirpepeKkFr0xfr-xfr-xb9adbaqaaeGaciGaaiaadeWaaq % aadaqbaaGcbaGaaGOmamaaCaaaleqabaGagiiBaWMaei4Ba8Maei4z % aCgaaOWaaWbaaSqabeaadaahaaadbeqaamaaBaaabaWaaWbaaeqaba % GaaGymaiabgkHiTiabgIGiodaaaeqaaaaaaaGcdaahaaWcbeqaaiab % d6gaUbaaaaa!4546! \[ 2^{\log } ^{^{_{^{1 - \in } } } } ^n \] (1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem

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

10.1007/3-540-45753-4_18 ◽

2002 ◽

pp. 200-214 ◽

Cited By ~ 12

Author(s):

Sven O. Krumke ◽

Luigi Laura ◽

Maarten Lipmann ◽

Alberto Marchetti-Spaccamela ◽

Willem E. de Paepe ◽

...

Keyword(s):

Traveling Salesman Problem ◽

Maximum Flow ◽

Flow Time ◽

Traveling Salesman ◽

Competitive Algorithm

Download Full-text

Typical Rounding Problems

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

10.1007/3-540-45753-4_9 ◽

2002 ◽

pp. 81-93

Author(s):

Benjamin Doerr

Download Full-text

On the Power of Priority Algorithms for Facility Location and Set Cover

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

10.1007/3-540-45753-4_5 ◽

2002 ◽

pp. 26-39 ◽

Cited By ~ 10

Author(s):

Spyros Angelopoulos ◽

Allan Borodin

Keyword(s):

Facility Location ◽

Set Cover ◽

Priority Algorithms

Download Full-text

Search and Classification of High Dimensional Data

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

10.1007/3-540-45753-4_1 ◽

2002 ◽

pp. 1-2

Author(s):

Yuval Rabani

Keyword(s):

High Dimensional Data ◽

High Dimensional

Download Full-text

A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs

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

10.1007/3-540-45753-4_13 ◽

2002 ◽

pp. 135-145 ◽

Cited By ~ 5

Author(s):

Krzysztof Giaro ◽

Robert Janczewski ◽

Marek Kubale ◽

Michał Małafiejski

Keyword(s):

Approximation Algorithm ◽

Bipartite Graphs ◽

Chromatic Sum ◽

Sum Coloring

Download Full-text

Two Approximation Algorithms for 3-Cycle Covers

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

10.1007/3-540-45753-4_6 ◽

2002 ◽

pp. 40-50 ◽

Cited By ~ 5

Author(s):

Markus Bläser ◽

Bodo Manthey

Keyword(s):

Approximation Algorithms ◽

Cycle Covers

Download Full-text

Approximation Algorithms for the Unsplittable Flow Problem

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

10.1007/3-540-45753-4_7 ◽

2002 ◽

pp. 51-66 ◽

Cited By ~ 21

Author(s):

Amit Chakrabarti ◽

Chandra Chekuri ◽

Anuptam Gupta ◽

Amit Kumar

Keyword(s):

Approximation Algorithms ◽

Flow Problem ◽

Unsplittable Flow

Download Full-text

Hardness of Approximation for Vertex-Connectivity Network-Design Problems

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

10.1007/3-540-45753-4_17 ◽

2002 ◽

pp. 185-199 ◽

Cited By ~ 20

Author(s):

Guy Kortsarz ◽

Robert Krauthgamer ◽

James R. Lee

Keyword(s):

Network Design ◽

Hardness Of Approximation ◽

Vertex Connectivity ◽

Design Problems ◽

Network Design Problems

Download Full-text

Approximating Maximum Edge Coloring in Multigraphs

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

10.1007/3-540-45753-4_11 ◽

2002 ◽

pp. 108-121 ◽

Cited By ~ 19

Author(s):

Uriel Feige ◽

Eran Ofek ◽

Udi Wieder

Keyword(s):

Edge Coloring

Download Full-text

Facility Location and the Geometric Minimum-Diameter Spanning Tree

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

10.1007/3-540-45753-4_14 ◽

2002 ◽

pp. 146-160 ◽

Cited By ~ 4

Author(s):

Joachim Gudmundsson ◽

Herman Haverkort ◽

Sang-Min Park ◽

Chan-Su Shin ◽

Alexander Wolff

Keyword(s):

Facility Location ◽

Spanning Tree ◽

Minimum Diameter ◽

Minimum Diameter Spanning Tree

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Typical Rounding Problems

On the Power of Priority Algorithms for Facility Location and Set Cover

Search and Classification of High Dimensional Data

A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs

Two Approximation Algorithms for 3-Cycle Covers

Approximation Algorithms for the Unsplittable Flow Problem

Hardness of Approximation for Vertex-Connectivity Network-Design Problems

Approximating Maximum Edge Coloring in Multigraphs

Facility Location and the Geometric Minimum-Diameter Spanning Tree

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