The maximum \(f\)-depth spanning tree problem (Q1603381): Difference between revisions

@@ Property / author @@
-Jérôme Monnot
@@ Property / author: Jérôme Monnot / rank @@
-Normal rank
@@ Property / author @@
+Jérôme Monnot
@@ Property / author: Jérôme Monnot / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate solution of NP optimization problems
@@ Property / cites work: Approximate solution of NP optimization problems / rank @@
+Normal rank
@@ Property / cites work @@
+Structure preserving reductions among convex optimization problems
+Normal rank
@@ Property / cites work @@
+The Steiner problem with edge lengths 1 and 2
@@ Property / cites work: The Steiner problem with edge lengths 1 and 2 / rank @@
+Normal rank
@@ Property / cites work @@
+Completeness in approximation classes
@@ Property / cites work: Completeness in approximation classes / rank @@
+Normal rank
@@ Property / cites work @@
+Differential approximation algorithms for some combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+Bridging gap between standard and differential polynomial approximation: The case of bin-packing
+Normal rank
@@ Property / cites work @@
+On an approximation measure founded on the links between optimization and polynomial approximation theory
+Normal rank
@@ Property / cites work @@
+An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Multicommodity flow models for spanning trees with hop constraints
+Normal rank
@@ Property / cites work @@
+Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
+Normal rank
@@ Property / cites work @@
+Designing reliable tree networks with two cable technologies
+Normal rank
@@ Property / cites work @@
+Approximating k-set cover and complementary graph coloring
+Normal rank
@@ Property / cites work @@
+Q3140426
@@ Property / cites work: Q3140426 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501786
@@ Property / cites work: Q5501786 / rank @@
+Normal rank
@@ Property / cites work @@
+Bicriteria Network Design Problems
@@ Property / cites work: Bicriteria Network Design Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4782716
@@ Property / cites work: Q4782716 / rank @@
+Normal rank
@@ Property / cites work @@
+The Traveling Salesman Problem with Distances One and Two
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0020-0190(01)00160-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2019955382
@@ Property / OpenAlex ID: W2019955382 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1603381