Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem (Q2819516): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-319-44543-4_26 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2537735054 / rank | |||
Normal rank | |||
Revision as of 14:26, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem |
scientific article |
Statements
Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem (English)
0 references
29 September 2016
0 references
