Scheduling web advertisements: a note on the minspace problem
type: Item
instance of: scholarly article
title: Scheduling web advertisements: a note on the minspace problem
zbMATH Open document ID: 1123.90021
author: Subodha Kumar
author: Milind Dawande
author: Chelliah Sriskandarajah
published in: Journal of Scheduling
publication date: 2007-05-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B60
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5153327
zbMATH Keywords: web advertising
zbMATH Keywords: scheduling
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: s10951-005-5217-6
OpenAlex ID: W2074220611
cites work: Scheduling space-sharing for internet advertising
cites work: Better Bounds for Online Scheduling
cites work: New algorithms for an ancient scheduling problem.
cites work: A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling"
cites work: An Application of Bin-Packing to Multiprocessor Scheduling
cites work: Performance bounds of algorithms for scheduling advertisements on a web page
cites work: On-line scheduling revisited
cites work: Tighter Bounds for the Multifit Processor Scheduling Algorithm
cites work: Evaluation of a MULTIFIT-based scheduling algorithm
cites work: Approximating the advertisement placement problem
cites work: An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
cites work: Bounds on Multiprocessing Timing Anomalies
cites work: A Better Algorithm for an Ancient Scheduling Problem
cites work: Q4265265
DOI: 10.1007/S10951-005-5217-6
description: scientific article; zbMATH DE number 5153327