Approximating minimum-cost graph problems with spanning tree edges (Q1892100): 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/0167-6377(94)90067-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2047085423
@@ Property / OpenAlex ID: W2047085423 / rank @@
+Normal rank
@@ Property / cites work @@
+A matching problem with side conditions
@@ Property / cites work: A matching problem with side conditions / rank @@
+Normal rank
@@ Property / cites work @@
+Q5675543
@@ Property / cites work: Q5675543 / rank @@
+Normal rank
@@ Property / cites work @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+Q4234132
@@ Property / cites work: Q4234132 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4763416
@@ Property / cites work: Q4763416 / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+A greedy heuristic for a minimum-weight forest problem
+Normal rank
@@ Property / cites work @@
+Q3787762
@@ Property / cites work: Q3787762 / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian location problems
@@ Property / cites work: Hamiltonian location problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3694703
@@ Property / cites work: Q3694703 / rank @@
+Normal rank
@@ Property / cites work @@
+A primal-dual approximation algorithm for generalized Steiner network problems
+Normal rank