Improved Approximation Algorithms for Minimum-Space Advertisement Scheduling

Dean, Brian C.; Goemans, Michel X.

doi:10.1007/3-540-45061-0_87

Cited by 10 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Adler et al 2002, Aggarwal et al 1998, Dawande et al 2003, Dean and Goemans 2003, Freund and Naor 2004. Frequently discussed problems in this area are how so called advertising banners of varying sizes should be placed on the screen, and how the banners should change over time (e.g.…”

Section: Literature Reviewmentioning

confidence: 99%

Revenue Management with Flexible Products

Müller-Bungart¹

2007

Lecture Notes in Economics and Mathematical Systems

View full text Add to dashboard Cite

Section: Literature Reviewmentioning

confidence: 99%

Revenue Management with Flexible Products

Müller-Bungart¹

2007

Lecture Notes in Economics and Mathematical Systems

View full text Add to dashboard Cite

“…The algorithm LSLF is also a ( 4 3 − 1 3K/w )-approximation to MIN K|w [4]. Dawande et al [4] present a 2-approximation for MINSPACE using LP Rouding, and Dean and Goemans [5] present a 4 3 -approximation for MINSPACE using Graham's algorithm for schedule [7].…”

Section: Introductionmentioning

confidence: 99%

A Polynomial-time Approximation Scheme for the MAXSPACE Advertisement Problem

Silva

Schouery

Pedrosa

2019

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

In the MAXSPACE problem, given a set of ads A, one wants to schedule a subset A ′ ⊆ A into K slots B 1 , . . . , B K of size L. Each ad A i ∈ A has a size s i and a frequency w i . A schedule is feasible if the total size of ads in any slot is at most L, and each ad A i ∈ A ′ appears in exactly w i slots. The goal is to find a feasible schedule that maximizes the sum of the space occupied by all slots. We introduce a generalization called MAXSPACE-R in which each ad A i also has a release date r i ≥ 1, and may only appear in a slot B j with j ≥ r i . We also introduce a generalization of MAXSPACE-R called MAXSPACE-RD in which each ad A i also has a deadline d i ≤ K, and may only appear in a slot B j with r i ≤ j ≤ d i . These parameters model situations where a subset of ads corresponds to a commercial campaign with an announcement date that may expire after some defined period. We present a 1/9-approximation algorithm for MAXSPACE-R and a polynomial-time approximation scheme for MAXSPACE-RD when K is bounded by a constant. This is the best factor one can expect, since MAXSPACE is NP-hard, even if K = 2.

show abstract

Truthful Mechanisms for Generalized Utilitarian Problems

Melideo

Penna

Proietti

et al.

IFIP International Federation for Information Processing

View full text Add to dashboard Cite

In this paper we investigate extensions of the well-known Vickrey-Clarke-Groves (VCG) mechanisms to problems whose objective function is not utilitarian and whose agents' utilities are not quasi-linear. We provide a generalization of utilitarian problems, termed consistent problems, and prove that every consistent problem admits a truthful mechanism. These mechanisms, termed VCGconsistent (VCGc) mechanisms, can be seen as a natural extension of VCG mechanisms for utilitarian problems. We then investigate extensions/restrictions of consistent problems. This yields three classes of problems for which (i) VCGc mechanisms are the only truthful mechanisms, (ii) no truthful VCGc mechanism exists, and (iii) no truthful mechanism exists, respectively. Showing that a given problem is in one of these three classes is straightforward, thus yielding a simple way to see whether VCGc mechanisms are appropriate or not.Finally, we apply our results to a number of basic non-utilitarian problems.

show abstract

Improved Approximation Algorithms for Minimum-Space Advertisement Scheduling

Cited by 10 publications

References 7 publications

Revenue Management with Flexible Products

Revenue Management with Flexible Products

A Polynomial-time Approximation Scheme for the MAXSPACE Advertisement Problem

Truthful Mechanisms for Generalized Utilitarian Problems

Contact Info

Product

Resources

About