An efficient algorithm for minimumk-covers in weighted graphs

DOI10.1007/BF01580426zbMath0321.05121OpenAlexW114839846MaRDI QIDQ4083700

Mark L. Gillenson, Lee J. White

Publication date: 1975

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01580426

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35)

Related Items (7)

Forest covers and a polyhedral intersection theorem ⋮ Edge covering problem under hybrid uncertain environments ⋮ Lot-sizing polyhedra with a cardinality constraint ⋮ An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints ⋮ Cluster generation and grouping using mathematical programming ⋮ Fuzzy minimum weight edge covering problem ⋮ Constrained weighted matchings and edge coverings in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Establishing the matching polytope
• TWO THEOREMS IN GRAPH THEORY
• An Algorithm for a Minimum Cover of a Graph
• Covers and packings in a family of sets
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• Integer Programming: Methods, Uses, Computations
• Paths, Trees, and Flowers
• Maximum matching and a polyhedron with 0,1-vertices
• Minimum Covers of Fixed Cardinality in Weighted Graphs

This page was built for publication: An efficient algorithm for minimumk-covers in weighted graphs