On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints (Q1975964): 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.1006/jcss.1999.1661
+Normal rank
@@ Property / OpenAlex ID @@
+W1966838648
@@ Property / OpenAlex ID: W1966838648 / rank @@
+Normal rank
@@ Property / cites work @@
+Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover
+Normal rank
@@ Property / cites work @@
+Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Combinatorial Problems
+Normal rank
@@ Property / cites work @@
+Q4231910
@@ Property / cites work: Q4231910 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234048
@@ Property / cites work: Q4234048 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3840354
@@ Property / cites work: Q3840354 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for Shop Scheduling Problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1975964