Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line
From MaRDI portal
Publication:3300763
DOI10.1137/19M1268513zbMath1451.68354arXiv1901.04272OpenAlexW3036408378MaRDI QIDQ3300763
Publication date: 30 July 2020
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.04272
competitive analysisonline algorithmscompetitive ratiodial-a-ride on the lineelevator problemsmartstart
Related Items (8)
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 ⋮ Improved bounds for revenue maximization in time-limited online dial-a-ride ⋮ Earliest deadline first is a 2-approximation for DARP with time windows ⋮ Maximizing the number of rides served for time-limited Dial-a-Ride* ⋮ An Improved Online Algorithm for the Traveling Repairperson Problem on a Line
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Routing a vehicle of capacity greater than one
- On-line dial-a-ride problems under a restricted information model
- The Online TSP Against Fair Adversaries
- Computer-Aided Complexity Classification of Dial-a-Ride Problems
- Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
- Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
- Tight Bounds for Online TSP on the Line
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Online Dial-A-Ride Problem with Time-Windows Under a Restricted Information Model
- Algorithmic Applications in Management
- Approximation and Online Algorithms
- Algorithms for the on-line travelling salesman
- On-line single-server dial-a-ride problems
This page was built for publication: Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line
