Approximation Algorithms for Node-Weighted Prize-Collecting Steiner Tree Problems on Planar Graphs (Q5369504): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| label / en | label / en | ||
Approximation Algorithms for Node-Weighted Prize-Collecting Steiner Tree Problems on Planar Graphs | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1601.02481 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2962942596 / rank | |||
Normal rank | |||
| Property / title | |||
Approximation Algorithms for Node-Weighted Prize-Collecting Steiner Tree Problems on Planar Graphs (English) | |||
| Property / title: Approximation Algorithms for Node-Weighted Prize-Collecting Steiner Tree Problems on Planar Graphs (English) / rank | |||
Normal rank | |||
Latest revision as of 11:26, 30 July 2024
scientific article; zbMATH DE number 6792378
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation Algorithms for Node-Weighted Prize-Collecting Steiner Tree Problems on Planar Graphs |
scientific article; zbMATH DE number 6792378 |
Statements
17 October 2017
0 references
approximation algorithms
0 references
node-weighted Steiner tree
0 references
primal-dual algorithm
0 references
LMP
0 references
planar graphs
0 references
Approximation Algorithms for Node-Weighted Prize-Collecting Steiner Tree Problems on Planar Graphs (English)
0 references
