Hardness and approximation results for packing Steiner trees (Q2369873): Difference between revisions

@@ Property / author @@
-Joseph Cheriyan
@@ Property / author: Joseph Cheriyan / rank @@
-Normal rank
@@ Property / author @@
+Joseph Cheriyan
@@ Property / author: Joseph Cheriyan / 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/s00453-005-1188-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2154295079
@@ Property / OpenAlex ID: W2154295079 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
+Normal rank
@@ Property / cites work @@
+Randomized metarounding
@@ Property / cites work: Randomized metarounding / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Directed Steiner Problems
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2004
@@ Property / cites work: Algorithms – ESA 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of Computation Theory
@@ Property / cites work: Fundamentals of Computation Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating theDomatic Number
@@ Property / cites work: Approximating theDomatic Number / rank @@
+Normal rank
@@ Property / cites work @@
+The directed subgraph homeomorphism problem
@@ Property / cites work: The directed subgraph homeomorphism problem / rank @@
+Normal rank
@@ Property / cites work @@
+On decomposing a hypergraph into \(k\) connected sub-hypergraphs
+Normal rank
@@ Property / cites work @@
+The Steiner tree packing problem in VLSI design
@@ Property / cites work: The Steiner tree packing problem in VLSI design / rank @@
+Normal rank
@@ Property / cites work @@
+Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+Maximum bounded 3-dimensional matching is MAX SNP-complete
+Normal rank
@@ Property / cites work @@
+Packing Steiner trees with identical terminal sets
+Normal rank
@@ Property / cites work @@
+A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
+Normal rank
@@ Property / cites work @@
+Approximating disjoint-path problems using packing integer programs
+Normal rank
@@ Property / cites work @@
+Edge-disjoint trees containing some given vertices in a graph
+Normal rank
@@ Property / cites work @@
+Q4280133
@@ Property / cites work: Q4280133 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4511239
@@ Property / cites work: Q4511239 / rank @@
+Normal rank