scientific article; zbMATH DE number 7378636

DOI10.4230/LIPIcs.APPROX-RANDOM.2018.24MaRDI QIDQ5009517

Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai

Publication date: 4 August 2021

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

generalized assignment problemapproximation algorithmspacking and covering problems

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Location and reorganization problems: the Calabrian health care system case
• Scheduling web advertisements: a note on the minspace problem
• Performance bounds of algorithms for scheduling advertisements on a web page
• Approximating the advertisement placement problem
• Tight Approximation Algorithms for Maximum Separable Assignment Problems
• How to Sell Hyperedges: The Hypermatching Assignment Problem

This page was built for publication: