68Q25 Analysis of algorithms and problem complexity [See also 68W40]
Refine
Year of publication
Document Type
- ZIB-Report (16)
- Habilitation (1)
- Master's Thesis (1)
Has Fulltext
- yes (18)
Is part of the Bibliography
- no (18)
Keywords
- computational complexity (3)
- NP-completeness (2)
- approximation (2)
- approximation algorithm (2)
- contraction degeneracy (2)
- online algorithms (2)
- polynomial-time approximation algorithms (2)
- stacker-crane problem (2)
- treewidth lower bounds (2)
- Approximation (1)
- Approximation Algorithms (1)
- Call Admission (1)
- Colorability (1)
- Competitive Analysis (1)
- Computational Complexity (1)
- Dial-a-Ride problem (1)
- Dial-a-Ride problem on trees (1)
- Dimensionierung (1)
- Eulerian Cycle (1)
- IGNORE strategy (1)
- Inverse Shortest Paths (1)
- Komplexität (1)
- Komplexitätstheorie (1)
- Mehrfachausfälle (1)
- NP-hardness (1)
- Network (1)
- Netzplanung (1)
- Optical Networks (1)
- P=NP (1)
- Ramachandramurthi parameter (1)
- Routing and Wavelength Allocation (1)
- Shortest Path Routing (1)
- Shortest path routing (1)
- Spaltengenerierung (1)
- budgeted maximum coverage (1)
- column generation (1)
- competitive analysis (1)
- completeness (1)
- complexity (1)
- disjoint paths (1)
- dynamic programming (1)
- elevator system (1)
- genus of a graph (1)
- graph algorithms (1)
- length bounded paths (1)
- lower bounds (1)
- maximum cardinality search (1)
- online algorithm (1)
- online optimization (1)
- planar graphs (1)
- pricing (1)
- probabilistic analysis (1)
- probabilistic competitive analysis (1)
- reducibility (1)
- routing (1)
- shortest path routing (1)
- survivable network design (1)
- treewidth (1)
- unsplittable flow (1)
- vehicle (1)
- vehicle routing (1)
Institute
- ZIB Allgemein (15)
- Mathematical Optimization (4)
In the Capacitated Dial-a-Ride Problem (CDARP) we are given a transportation network and a finite set of transportation jobs. Each job specifies the source and target location which are both part of the network. A server which can carry at most $C$~objects at a time can move on the transportation network in order to process the transportation requests. The problem CDARP consists of finding a shortest transportation for the jobs starting and ending at a designated start location. In this paper we are concerned with the restriction of CDARP to graphs which are simple paths. This setting arises for instance when modelling applications in elevator transportation systems. It is known that even for this restricted class of graphs CDARP is NP-hard to solve. We provide a polynomial time approximation algorithm that finds a transportion of length at most thrice the length of the optimal transportation.