An efficient algorithm for minimumk-covers in weighted graphs (Q4083700): Difference between revisions

@@ Property / cites work @@
+Integer Programming: Methods, Uses, Computations
@@ Property / cites work: Integer Programming: Methods, Uses, Computations / rank @@
+Normal rank
@@ Property / cites work @@
+Q5612355
@@ Property / cites work: Q5612355 / rank @@
+Normal rank
@@ Property / cites work @@
+Establishing the matching polytope
@@ Property / cites work: Establishing the matching polytope / rank @@
+Normal rank
@@ Property / cites work @@
+TWO THEOREMS IN GRAPH THEORY
@@ Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank @@
+Normal rank
@@ Property / cites work @@
+Covers and packings in a family of sets
@@ Property / cites work: Covers and packings in a family of sets / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+Q5675543
@@ Property / cites work: Q5675543 / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+An Algorithm for a Minimum Cover of a Graph
@@ Property / cites work: An Algorithm for a Minimum Cover of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Covers of Fixed Cardinality in Weighted Graphs
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01580426
+Normal rank
@@ Property / OpenAlex ID @@
+W114839846
@@ Property / OpenAlex ID: W114839846 / rank @@
+Normal rank