The Lazy Matroid Problem

DOI10.1007/978-3-662-44602-7_6zbMath1417.68287OpenAlexW86767800MaRDI QIDQ3190151

Laurent Gourvès, Aris Pagourtzis, Jérôme Monnot

Publication date: 15 September 2014

Published in: Advanced Information Systems Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44602-7_6

zbMATH Keywords

matroidsapproximation algorithmsindependent dominating set

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Approximation algorithms (68W25)

Related Items (4)

Subset sum problems with digraph constraints ⋮ An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem ⋮ Online lazy bureaucrat scheduling with a machine deadline ⋮ Weighted Upper Edge Cover: Complexity and Approximability

This page was built for publication: The Lazy Matroid Problem