scientific article; zbMATH DE number 1405687
From MaRDI portal
Publication:4938668
Recommendations
- Approximations of Weighted Independent Set and Hereditary Subset Problems
- Graph-Theoretic Concepts in Computer Science
- Approximation algorithms for the weighted independent set problem in sparse graphs
- On approximation problems related to the independent set and vertex cover problems
- A note on the approximation of a minimum-weight maximal independent set
- Approximating weighted neighborhood independent sets
- On the complexity of approximating the independent set problem
- On the complexity of approximating the independent set problem (extended abstract)
- Parameterized algorithms for the independent set problem in some hereditary graph classes
- Approximation schemes for a class of subset selection problems
Cited in
(13)- Approximation algorithms for the weighted independent set problem in sparse graphs
- A note on the approximation of a minimum-weight maximal independent set
- Approximating weighted neighborhood independent sets
- Conversion of coloring algorithms into maximum weight independent set algorithms
- Competitive and collaborative influence in social networks
- Improved approximations for weighted and unweighted graph problems
- Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location
- Approximations of Weighted Independent Set and Hereditary Subset Problems
- Graph-Theoretic Concepts in Computer Science
- Algorithm for optimal winner determination in combinatorial auctions
- Constructive -- non-constructive approximation and maximum independent set problem
- Obviously strategyproof single-minded combinatorial auctions
- Approximation of min coloring by moderately exponential algorithms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4938668)
