Approximation and Online Algorithms
From MaRDI portal
Publication:5898478
DOI10.1007/11671411zbMath1177.90394MaRDI 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
Unnamed Item, New Bounds for Maximizing Revenue in Online Dial-a-Ride, 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., Unnamed Item, Car-sharing between two locations: online scheduling with flexible advance bookings, 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, An improved algorithm for open online dial-a-ride, Typology and literature review for dial-a-ride problems, Algorithms for on-line order batching in an order picking warehouse, Improved bounds for revenue maximization in time-limited online dial-a-ride, The online food delivery problem on stars, Tight competitive analyses of online car-sharing 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
Uses Software
