↓ Skip to main content
What is this page? Embed badge

Approximation and Online Algorithms

Overview of attention for book
Cover of 'Approximation and Online Algorithms'

Table of Contents

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

Readers on

mendeley
2 Mendeley
Summary
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Tight Approximation Bounds for the Seminar Assignment Problem
Chapter number 14
Book title
Approximation and Online Algorithms
Published by
Springer, Cham, August 2016
DOI 10.1007/978-3-319-51741-4_14
Book ISBNs
978-3-31-951740-7, 978-3-31-951741-4
Authors

Amotz Bar-Noy, George Rabanca, Bar-Noy, Amotz, Rabanca, George

View on publisher site
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Professor 1 50%
Student > Ph. D. Student 1 50%
Readers by discipline Count As %
Computer Science 2 100%

This page is provided by Altmetric.