On the complexity of vertex-disjoint length-restricted path problems
type: Item
instance of: scholarly article
title: On the complexity of vertex-disjoint length-restricted path problems
zbMATH Open document ID: 1085.68066
author: Andreas Bley
published in: Computational Complexity
publication date: 2005-02-11T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 2133455
zbMATH Keywords: Disjoint paths
zbMATH Keywords: length-restricted paths
zbMATH Keywords: approximability
MaRDI profile type: Publication
full work available at URL: s00037-003-0179-6
OpenAlex ID: W1999679195
DOI: 10.1007/S00037-003-0179-6
Recommended article: Q3998558
Recommended article: On the complexity of the disjoint paths problem
Recommended article: Q3211338
Recommended article: On the complexity of finding internally vertex-disjoint long directed paths
Recommended article: On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems
Recommended article: On the complexity of the planar directed edge-disjoint paths problem
Recommended article: Q4610074
Recommended article: On the computational complexity of length- and neighborhood-constrained path problems
Recommended article: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
description: scientific article; zbMATH DE number 2133455