scientific article; zbMATH DE number 1947058
From MaRDI portal
Publication:4411288
zbMath1013.90128MaRDI QIDQ4411288
Willem E. de Paepe, Luigi Laura, Diana Poensgen, Maarten Lipmann, Alberto Marchetti-Spaccamela, Sven O. Krumke, Leen Stougie
Publication date: 7 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2462/24620200.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (17)
Online \(k\)-server routing problems ⋮ Evaluating the quality of online optimization algorithms by discrete event simulation ⋮ On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis ⋮ Minimizing the maximum flow time in the online food delivery problem ⋮ Tight analysis of the lazy algorithm for open online dial-a-ride ⋮ Unnamed Item ⋮ An improved algorithm for open online dial-a-ride ⋮ Improved bounds for open online dial-a-ride on the line ⋮ Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line ⋮ On the power of lookahead in on-line server routing problems ⋮ New policies for the dynamic traveling salesman problem ⋮ Unnamed Item ⋮ How to whack moles ⋮ An adversarial queueing model for online server routing ⋮ An Improved Online Algorithm for the Traveling Repairperson Problem on a Line ⋮ The online food delivery problem on stars ⋮ Topology matters: smoothed competitiveness of metrical task systems
This page was built for publication:
