Independent Sets in Bounded-Degree Hypergraphs

DOI10.1007/978-3-540-73951-7_24zbMath1209.05160OpenAlexW1527985860MaRDI QIDQ3603532

Elena Losievskaja, Magnús M. Halldórsson

Publication date: 17 February 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-73951-7_24

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)

Related Items (2)

A better differential approximation ratio for symmetric TSP ⋮ New differential approximation algorithm for \(k\)-customer vehicle routing problem

This page was built for publication: Independent Sets in Bounded-Degree Hypergraphs