Approximating the advertisement placement problem
From MaRDI portal
Publication:2464430
DOI10.1023/B:JOSH.0000036860.90818.5fzbMath1154.90450OpenAlexW2618574501MaRDI QIDQ2464430
Joseph (Seffi) Naor, Ari Freund
Publication date: 20 December 2007
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:josh.0000036860.90818.5f
Related Items
Two for One: Tight Approximation of 2D Bin Packing ⋮ Scheduling web advertisements: a note on the minspace problem ⋮ Maximizing revenue with allocation of multiple advertisements on a Web banner ⋮ Unnamed Item ⋮ TWO FOR ONE: TIGHT APPROXIMATION OF 2D BIN PACKING ⋮ Adaptive large neighborhood search for solving the circle bin packing problem ⋮ Approximation algorithms for orthogonal packing problems for hypercubes