A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees (Q4360134): Difference between revisions

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+A network-flow technique for finding low-weight bounded-degree spanning trees
@@ description / en / description / en @@
+scientific article; zbMATH DE number 7000343
@@ Property / title @@
+A network-flow technique for finding low-weight bounded-degree spanning trees (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.90099
@@ Property / zbMATH Open document ID: 1415.90099 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/3-540-61310-2_9
@@ Property / DOI: 10.1007/3-540-61310-2_9 / rank @@
+Normal rank
@@ Property / published in @@
+Integer Programming and Combinatorial Optimization
+Normal rank
@@ Property / publication date @@
+January 2019Timestamp +2019-01-11T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2019-01-11T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 11 January 2019 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C27
@@ Property / Mathematics Subject Classification ID: 90C27 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 90C35 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+7000343
@@ Property / zbMATH DE Number: 7000343 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+span tree
@@ Property / zbMATH Keywords: span tree / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+minimum span tree
@@ Property / zbMATH Keywords: minimum span tree / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+edge weight
@@ Property / zbMATH Keywords: edge weight / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+performance guarantee
@@ Property / zbMATH Keywords: performance guarantee / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+positive flow
@@ Property / zbMATH Keywords: positive flow / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1930167353
@@ Property / OpenAlex ID: W1930167353 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
+Normal rank
@@ Property / cites work @@
+Approximating the Minimum-Degree Steiner Tree to within One of Optimal
+Normal rank
@@ Property / cites work @@
+A good algorithm for smallest spanning trees with a degree constraint
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for a family of matroid intersection problems
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Topological design of centralized computer networks—formulations and algorithms
+Normal rank
@@ Property / cites work @@
+Q4068469
@@ Property / cites work: Q4068469 / rank @@
+Normal rank
@@ Property / cites work @@
+Low degree spanning trees of small weight
@@ Property / cites work: Low degree spanning trees of small weight / rank @@
+Normal rank
@@ Property / cites work @@
+Balancing minimum spanning trees and shortest-path trees
+Normal rank
@@ Property / cites work @@
+Transitions in geometric minimum spanning trees
@@ Property / cites work: Transitions in geometric minimum spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+On two geometric problems related to the travelling salesman problem
+Normal rank
@@ Property / cites work @@
+Many birds with one stone
@@ Property / cites work: Many birds with one stone / rank @@
+Normal rank
@@ Property / cites work @@
+Low-degree minimum spanning trees
@@ Property / cites work: Low-degree minimum spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Euclidean spanner graphs with degree four
@@ Property / cites work: Euclidean spanner graphs with degree four / rank @@
+Normal rank
@@ Property / cites work @@
+Edge exchanges in the degree-constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Design of survivable networks
@@ Property / cites work: Design of survivable networks / rank @@
+Normal rank
@@ Property / cites work @@
+A Lagrangean approach to the degree-constrained minimum spanning tree problem
+Normal rank

Latest revision as of 19:56, 17 July 2024

scientific article; zbMATH DE number 7000343

A network-flow technique for finding low-weight bounded-degree spanning trees

Language	Label	Description	Also known as
English	A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees	scientific article; zbMATH DE number 7000343	A network-flow technique for finding low-weight bounded-degree spanning trees