Approximation and Online Algorithms
From MaRDI portal
Publication:5898478
DOI10.1007/11671411zbMath1177.90394OpenAlexW4210634114MaRDI QIDQ5898478
Sven O. Krumke, Diana Poensgen, Leen Stougie, Willem E. de Paepe, Alberto Marchetti-Spaccamela, Maarten Lipmann
Publication date: 12 February 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11671411
Related Items (17)
New Bounds for Maximizing Revenue in Online Dial-a-Ride ⋮ Online car-sharing problem with variable booking times ⋮ 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 ⋮ Typology and literature review for dial-a-ride problems ⋮ 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 ⋮ Car-sharing between two locations: online scheduling with flexible advance bookings ⋮ Improved bounds for revenue maximization in time-limited online dial-a-ride ⋮ Algorithms for on-line order batching in an order picking warehouse ⋮ Unnamed Item ⋮ An Improved Online Algorithm for the Traveling Repairperson Problem on a Line ⋮ Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings. ⋮ The online food delivery problem on stars ⋮ Tight competitive analyses of online car-sharing problems
Uses Software
This page was built for publication: Approximation and Online Algorithms
