Minimum cost edge subset covering exactly \(k\) vertices of a graph
From MaRDI portal
Publication:5952317
DOI10.1023/A:1011457225589zbMath1078.90063MaRDI QIDQ5952317
Publication date: 2001
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Related Items
Edge covering problem under hybrid uncertain environments, Heuristics for automated knowledge source integration and service composition, Fuzzy minimum weight edge covering problem