A polynomial-time \(\mathrm{OPT}^\varepsilon\)-approximation algorithm for maximum independent set of connected subgraphs in a planar graph (Q6645368)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7951096
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time \(\mathrm{OPT}^\varepsilon\)-approximation algorithm for maximum independent set of connected subgraphs in a planar graph |
scientific article; zbMATH DE number 7951096 |
Statements
A polynomial-time \(\mathrm{OPT}^\varepsilon\)-approximation algorithm for maximum independent set of connected subgraphs in a planar graph (English)
0 references
28 November 2024
0 references
