Title | ||
---|---|---|
Primal-Dual Approximation Algorithms for Node-Weighted Network Design in Planar Graphs. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1007/978-3-642-32512-0_5 | APPROX-RANDOM |
Field | DocType | Citations |
Discrete mathematics,Approximation algorithm,Combinatorics,Network planning and design,Steiner tree problem,Weighted network,Feedback vertex set,Mathematics,Planar graph,Steiner forest | Conference | 2 |
PageRank | References | Authors |
0.37 | 19 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Piotr Berman | 1 | 1754 | 192.48 |
Grigory Yaroslavtsev | 2 | 209 | 17.36 |