Approximation and Online Algorithms
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 The Shortest Separating Cycle Problem
-
Altmetric BadgeChapter 2 Dynamic Traveling Repair Problem with an Arbitrary Time Window
-
Altmetric BadgeChapter 3 A PTAS for the Cluster Editing Problem on Planar Graphs
-
Altmetric BadgeChapter 4 Bin Packing with Colocations
-
Altmetric BadgeChapter 5 Batch Coloring of Graphs
-
Altmetric BadgeChapter 6 New Integrality Gap Results for the Firefighters Problem on Trees
-
Altmetric BadgeChapter 7 A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs
-
Altmetric BadgeChapter 8 Balanced Optimization with Vector Costs
-
Altmetric BadgeChapter 9 Vertex Sparsification in Trees
-
Altmetric BadgeChapter 10 Scenario Submodular Cover
-
Altmetric BadgeChapter 11 Non-greedy Online Steiner Trees on Outerplanar Graphs
-
Altmetric BadgeChapter 12 A Refined Analysis of Online Path Coloring in Trees
-
Altmetric BadgeChapter 13 Resource Allocation Games with Multiple Resource Classes
-
Altmetric BadgeChapter 14 Tight Approximation Bounds for the Seminar Assignment Problem
-
Altmetric BadgeChapter 15 A priori TSP in the Scenario Model
-
Altmetric BadgeChapter 16 Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems