Semi-preemptive routing on trees

DOI10.1016/j.dam.2008.05.016zbMath1155.90347OpenAlexW2086806812MaRDI QIDQ1003476

Rainer Schrader, Sven O. Krumke, Dirk Räbiger

Publication date: 4 March 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.05.016

zbMATH Keywords

transportationapproximationdial-a-ridepickup and deliverycolored arborescencesStacker crane

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Applications of graph theory (05C90) Traffic problems in operations research (90B20)

Related Items (1)

Semi-preemptive routing on a linear and circular track

Cites Work

• Unnamed Item
• Semi-preemptive routing on a linear and circular track
• Exact arborescences, matchings and cycles
• Routing a vehicle of capacity greater than one
• Nonpreemptive Ensemble Motion Planning on a Tree
• A threshold of ln n for approximating set cover
• Semi–preemptive routing on a line
• Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
• Preemptive Ensemble Motion Planning on a Tree
• Euler is standing in line dial-a-ride problems with precedence-constraints

This page was built for publication: Semi-preemptive routing on trees