Pages that link to "Item:Q5369504"
From MaRDI portal
The following pages link to Approximation Algorithms for Node-Weighted Prize-Collecting Steiner Tree Problems on Planar Graphs (Q5369504):
Displaying 6 items.
- Primal-dual approximation algorithms for node-weighted Steiner forest on planar graphs (Q1951588) (← links)
- An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties (Q2167423) (← links)
- Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems (Q4571047) (← links)
- (Q5365098) (← links)
- Approximating node-weighted \(k\)-MST on planar graphs (Q5918856) (← links)
- A 2-approximation for the \(k\)-prize-collecting Steiner tree problem (Q5970779) (← links)