Finding paths with minimum shared edges
type: Item
instance of: scholarly article
title: Finding paths with minimum shared edges
zbMATH Open document ID: 1282.90219
author: Masoud T. Omran
author: Jörg-Rüdiger Sack
author: Hamid Zarrabi-Zadeh
published in: Journal of Combinatorial Optimization
publication date: 2013-12-09T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6236739
zbMATH Keywords: minimum shared edges problem
zbMATH Keywords: approximation algorithm
zbMATH Keywords: inapproximability
zbMATH Keywords: heuristic algorithms
MaRDI profile type: Publication
full work available at URL: s10878-012-9462-2
OpenAlex ID: W2104070086
Wikidata QID: Q62037431
cites work: Finding minimum-cost flows by double scaling
cites work: Improved Approximation Algorithms for Label Cover Problems
cites work: On network design problems: fixed cost flows and the covering steiner problem
cites work: Q4198056
cites work: Beyond the flow decomposition barrier
cites work: The complexity of finding maximum disjoint paths with length constraints
cites work: On shortest disjoint paths in planar graphs
cites work: Q4494412
cites work: The complexity of finding two disjoint paths with min-max objective function
cites work: Finding disjoint paths with different path-costs: Complexity and algorithms
cites work: A quick method for finding shortest pairs of disjoint paths
DBLP publication ID: journals/jco/OmranSZ13
DOI: 10.1007/S10878-012-9462-2
Recommended article: Finding Paths with Minimum Shared Edges
Recommended article: On finding Min-Min disjoint paths
Recommended article: Q4297298
Recommended article: Finding the Minimum-Weight k-Path
Recommended article: Q3351166
Recommended article: Minimum-link paths revisited
Recommended article: Q3108686
Recommended article: Finding Minors in Graphs with a Given Path Structure
Recommended article: Graph path minimization problem
Recommended article: Finding the shortest paths by node combination
description: scientific article; zbMATH DE number 6236739