On-line models and algorithms for max independent set
From MaRDI portal
Publication:3411297
Recommendations
Cites work
- scientific article; zbMATH DE number 2079869 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- Algorithms for the on-line travelling salesman
- Approximations of Weighted Independent Set and Hereditary Subset Problems
- Improved approximations for maximum independent set via approximation chains
- Improved approximations for weighted and unweighted graph problems
- Online independent sets.
Cited in
(7)- scientific article; zbMATH DE number 1953086 (Why is no real title available?)
- scientific article; zbMATH DE number 1696636 (Why is no real title available?)
- Algorithms and Computation
- scientific article; zbMATH DE number 5842466 (Why is no real title available?)
- On-line maximum-order induced hereditary subgraph problems
- Online independent sets.
- Advice complexity of maximum independent set in sparse and bipartite graphs
This page was built for publication: On-line models and algorithms for max independent set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3411297)