scientific article; zbMATH DE number 7650088

DOI10.4230/LIPIcs.APPROX-RANDOM.2019.21MaRDI QIDQ5875473

Alexander Birx, Yann Disser, Kevin Schewior

Publication date: 3 February 2023

Full work available at URL: https://arxiv.org/abs/1907.02858

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

competitive analysisonline algorithmscompetitive ratiodial-a-ride on the lineelevator problemsmartstart

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (3)

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

Uses Software

• DARCLASS

Cites Work

• 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
• Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line
• 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: