Approximating the $$k$$-Set Packing Problem by Local Improvements

DOI10.1007/978-3-319-09174-7_35zbMath1452.90264arXiv1307.2262OpenAlexW1676390513MaRDI QIDQ3195350

Huiwen Yu, Martin Fuerer

Publication date: 16 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.2262

zbMATH Keywords

local improvementcolor coding\(k\)-set packingtail change

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (11)

The limits of local search for weighted \(k\)-set packing ⋮ An improved kernel for planar vertex-disjoint triangle packing ⋮ An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem† ⋮ On maximum bipartite matching with separation ⋮ Ignorance Is Almost Bliss: Near-Optimal Stochastic Matching with Few Queries ⋮ Iterated local search with Trellis-neighborhood for the partial Latin square extension problem ⋮ A randomized approximation algorithm for metric triangle packing ⋮ Realization problems on reachability sequences ⋮ Stability and Recovery for Independence Systems ⋮ Leafy spanning arborescences in DAGs ⋮ Distributed algorithms for matching in hypergraphs

This page was built for publication: Approximating the $$k$$-Set Packing Problem by Local Improvements