Independent Sets in Bounded-Degree Hypergraphs
DOI10.1007/978-3-540-73951-7_24zbMATH Open1209.05160OpenAlexW1527985860MaRDI QIDQ3603532FDOQ3603532
Authors: Magnús M. Halldórsson, Elena Losievskaja 
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
Recommendations
- Independent sets in bounded-degree hypergraphs
- Greed is good: approximating independent sets in sparse and bounded-degree graphs
- scientific article; zbMATH DE number 1003268
- Improved approximations of independent sets in bounded-degree graphs
- SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Hypergraphs (05C65)
Cited In (14)
- Independent sets in bounded-degree hypergraphs
- Hypergraph Independent Sets
- Differential Methods for Finding Independent Sets in Hypergraphs
- A better differential approximation ratio for symmetric TSP
- Lower bounds for constant degree independent sets
- New differential approximation algorithm for \(k\)-customer vehicle routing problem
- Title not available (Why is that?)
- SDP-based algorithms for maximum independent set problems on hypergraphs
- On the number of independent sets in simple hypergraphs
- Locally defined independence systems on graphs
- The Benes Network is q*(q-1)/2n-Almost q-set-wise Independent
- Independent Sets in Regular Hypergraphs and Multidimensional Runlength-Limited Constraints
- SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
- Title not available (Why is that?)
This page was built for publication: Independent Sets in Bounded-Degree Hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603532)
