Semi-preemptive routing on trees

DOI10.1016/J.DAM.2008.05.016MaRDI QIDQ1003476zbMATH OpenOpenAlexFDO

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

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

approximationtransportationpickup and deliverydial-a-ridecolored arborescencesStacker crane

Mathematics Subject Classification ID

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

Recommendations

• Routing on trees
• Routing on trees via matchings
• Semi–preemptive routing on a line
• On interval routing schemes and treewidth
• scientific article; zbMATH DE number 1756017
• scientific article; zbMATH DE number 1303574
• Euro-Par 2004 Parallel Processing
• On-line matching routing on trees
• Algorithms – ESA 2005
• Routeing on trees

Cites work

• scientific article; zbMATH DE number 1775400 (Why is no real title available?)
• A threshold of ln n for approximating set cover
• Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
• Euler is standing in line dial-a-ride problems with precedence-constraints
• Exact arborescences, matchings and cycles
• Nonpreemptive Ensemble Motion Planning on a Tree
• Preemptive Ensemble Motion Planning on a Tree
• Routing a vehicle of capacity greater than one
• Semi-preemptive routing on a linear and circular track
• Semi–preemptive routing on a line

Cited in

(4)

• Semi-preemptive routing on a linear and circular track
• Models for the single-vehicle preemptive pickup and delivery problem
• Semi–preemptive routing on a line
• Routing on trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1003476)