Approximating weighted neighborhood independent sets
From MaRDI portal
(Redirected from Publication:1679903)
Recommendations
- scientific article; zbMATH DE number 1182757
- A note on the approximation of a minimum-weight maximal independent set
- Approximation algorithms for the weighted independent set problem in sparse graphs
- Approximating independent set in perturbed graphs
- Approximations of Weighted Independent Set and Hereditary Subset Problems
- scientific article; zbMATH DE number 1405687
- Approximating independent sets in sparse graphs
- Weighted domination of independent sets
- Simple and local independent set approximation
Cites work
- k-Neighborhood-Covering and -Independence Problems for Chordal Graphs
- A Linear Recognition Algorithm for Cographs
- Algorithmic aspects of clique-transversal and clique-independent sets
- Algorithmic Aspects of Neighborhood Numbers
- Complement reducible graphs
- Minimal non-neighborhood-perfect graphs
- Neighborhood perfect graphs
- Neighbourhood-perfect line graphs
- Non-approximability results for optimization problems on bounded degree instances
- On tree-constrained matchings and generalizations
This page was built for publication: Approximating weighted neighborhood independent sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1679903)