A note on approximating the min-max vertex disjoint paths on directed acyclic graphs (Q657914): Difference between revisions

@@ 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.1016/j.jcss.2010.08.012
+Normal rank
@@ Property / OpenAlex ID @@
+W1997781700
@@ Property / OpenAlex ID: W1997781700 / rank @@
+Normal rank
@@ Property / cites work @@
+An improved FPTAS for Restricted Shortest Path.
@@ Property / cites work: An improved FPTAS for Restricted Shortest Path. / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for k-Disjoint Paths Problems on DAGs
+Normal rank
@@ Property / cites work @@
+Approximation Schemes for the Restricted Shortest Path Problem
+Normal rank
@@ Property / cites work @@
+Length-bounded disjoint paths in planar graphs
@@ Property / cites work: Length-bounded disjoint paths in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of finding two disjoint paths with min-max objective function
+Normal rank
@@ Property / cites work @@
+A simple efficient approximation scheme for the restricted shortest path problem
+Normal rank
@@ Property / cites work @@
+Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax \(k\) vertex-disjoint paths in a directed acyclic graph
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:657914