An extension of the edge covering problem

DOI10.1007/BF01583800zbMath0482.90085OpenAlexW2013473199MaRDI QIDQ3941210

No author found.

Publication date: 1982

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

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

zbMATH Keywords

linear relaxationoptimum solutionrounding offweighted r-covering problemvertex r-packing problemweighted edge covering problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Related Items (2)

A rounding algorithm for integer programs ⋮ A decomposition algorithm for linear relaxation of the weightedr-covering problem

Cites Work

• Vertex packings: Structural properties and algorithms
• Order in Logic and Integral Domains
• Unnamed Item
• Unnamed Item

This page was built for publication: An extension of the edge covering problem