Finding paths with minimum shared edges (Q386426): Difference between revisions

@@ Property / DOI @@
-.1007/s10878-012-9462-2
@@ Property / DOI: 10.1007/s10878-012-9462-2 / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 90C35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C27
@@ Property / Mathematics Subject Classification ID: 90C27 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C59
@@ Property / Mathematics Subject Classification ID: 90C59 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6236739
@@ Property / zbMATH DE Number: 6236739 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+minimum shared edges problem
@@ Property / zbMATH Keywords: minimum shared edges problem / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximation algorithm
@@ Property / zbMATH Keywords: approximation algorithm / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+inapproximability
@@ Property / zbMATH Keywords: inapproximability / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+heuristic algorithms
@@ Property / zbMATH Keywords: heuristic algorithms / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-012-9462-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2104070086
@@ Property / OpenAlex ID: W2104070086 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q62037431
@@ Property / Wikidata QID: Q62037431 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding minimum-cost flows by double scaling
@@ Property / cites work: Finding minimum-cost flows by double scaling / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for Label Cover Problems
+Normal rank
@@ Property / cites work @@
+On network design problems: fixed cost flows and the covering steiner problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Beyond the flow decomposition barrier
@@ Property / cites work: Beyond the flow decomposition barrier / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of finding maximum disjoint paths with length constraints
+Normal rank
@@ Property / cites work @@
+On shortest disjoint paths in planar graphs
@@ Property / cites work: On shortest disjoint paths in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4494412
@@ Property / cites work: Q4494412 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of finding two disjoint paths with min-max objective function
+Normal rank
@@ Property / cites work @@
+Finding disjoint paths with different path-costs: Complexity and algorithms
+Normal rank
@@ Property / cites work @@
+A quick method for finding shortest pairs of disjoint paths
+Normal rank
@@ Property / DBLP publication ID @@
+journals/jco/OmranSZ13
@@ Property / DBLP publication ID: journals/jco/OmranSZ13 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10878-012-9462-2
@@ Property / DOI: 10.1007/S10878-012-9462-2 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:386426