scientific article; zbMATH DE number 7559124

DOI10.4230/LIPIcs.STACS.2019.15MaRDI QIDQ5090461

Alexander Birx, Yann Disser

Publication date: 18 July 2022

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

Theory of computing (68Qxx)

Related Items (2)

New Bounds for Maximizing Revenue in Online Dial-a-Ride ⋮ Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: