A hard dial-a-ride problem that is easy on average
type: Item
instance of: scholarly article
title: A hard dial-a-ride problem that is easy on average
zbMATH Open document ID: 1123.90019
author: Amin Coja-Oghlan
author: Sven O. Krumke
author: Till Nierhoff
published in: Journal of Scheduling
publication date: 2007-05-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5153332
zbMATH Keywords: average-case analysis
zbMATH Keywords: NP-hard
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
full work available at URL: s10951-005-6811-3
OpenAlex ID: W1990779476
cites work: Q2728857
cites work: Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
cites work: Algorithms for the on-line travelling salesman
cites work: The Steiner problem with edge lengths 1 and 2
cites work: Random graphs.
cites work: Q4223058
cites work: A heuristic for the Stacker Crane Problem on trees which is almost surely exact
cites work: Heuristics for semirandom graph problems
cites work: Q5538132
cites work: On-line single-server dial-a-ride problems
cites work: A Note on the Complexity of a Simple Transportation Problem
cites work: Nonpreemptive Ensemble Motion Planning on a Tree
cites work: Q3122905
cites work: Q3956129
cites work: Q2746971
cites work: Q2728895
cites work: Euler is standing in line dial-a-ride problems with precedence-constraints
cites work: Q4782696
DOI: 10.1007/S10951-005-6811-3
description: scientific article; zbMATH DE number 5153332