Pages that link to "Item:Q4840221"
From MaRDI portal
The following pages link to A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees (Q4840221):
Displaying 50 items.
- Optimal relay node placement in delay constrained wireless sensor network design (Q297218) (← links)
- Lower and upper bounds for the spanning tree with minimum branch vertices (Q377727) (← links)
- Survivable network activation problems (Q386909) (← links)
- Competitive and deterministic embeddings of virtual networks (Q391268) (← links)
- PTAS for minimum weighted connected vertex cover problem with \(c\)-local condition in unit disk graphs (Q411246) (← links)
- Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
- Distributed reformation of core-based group-shared multicast trees in mobile ad hoc networks (Q436764) (← links)
- On the hardness of full Steiner tree problems (Q491161) (← links)
- Bounded-degree spanning tree problems: models and new algorithms (Q632386) (← links)
- Approximating some network design problems with node costs (Q638508) (← links)
- Approximating fault-tolerant group-Steiner problems (Q764316) (← links)
- Approximation algorithms for requirement cut on graphs (Q848961) (← links)
- Node-weighted Steiner tree approximation in unit disk graphs (Q849134) (← links)
- Sharing the cost of multicast transmissions in wireless networks (Q861267) (← links)
- Approximating minimum power covers of intersecting families and directed edge-connectivity problems (Q974743) (← links)
- Wireless network design via 3-decompositions (Q990943) (← links)
- Algorithms for connected set cover problem and fault-tolerant connected set cover problem (Q1006053) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Approximating the weight of shallow Steiner trees (Q1296580) (← links)
- On approximability of the independent/connected edge dominating set problems (Q1603390) (← links)
- A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points (Q1607061) (← links)
- Trees, paths, stars, caterpillars and spiders (Q1635718) (← links)
- Secluded connectivity problems (Q1679225) (← links)
- Covering problems in edge- and node-weighted graphs (Q1751155) (← links)
- Approximation algorithms for highly connected multi-dominating sets in unit disk graphs (Q1755744) (← links)
- Approximating Steiner trees and forests with minimum number of Steiner points (Q1796259) (← links)
- Generalized network design problems. (Q1810478) (← links)
- The General Steiner Tree-Star problem. (Q1853139) (← links)
- Improved methods for approximating node weighted Steiner trees and connected dominating sets. (Q1854264) (← links)
- Spider covers and their applications (Q1935978) (← links)
- Approximations for node-weighted Steiner tree in unit disk graphs (Q1958644) (← links)
- Two-level hub Steiner trees (Q2059893) (← links)
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q2117101) (← links)
- 2-node-connectivity network design (Q2117701) (← links)
- Approximating \(k\)-connected \(m\)-dominating sets (Q2144267) (← links)
- Approximating activation edge-cover and facility location problems (Q2166781) (← links)
- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results (Q2216123) (← links)
- Approximation algorithms for the connected sensor cover problem (Q2290655) (← links)
- An approximation algorithm for vehicle routing with compatibility constraints (Q2294242) (← links)
- Parameterized analysis of the online priority and node-weighted Steiner tree problems (Q2322716) (← links)
- Hardness and approximation results for packing Steiner trees (Q2369873) (← links)
- Approximation schemes for node-weighted geometric Steiner tree problems (Q2391178) (← links)
- Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
- Bounded-hops power assignment in ad hoc wireless networks (Q2492211) (← links)
- Approximation algorithms for priority Steiner tree problems (Q2695278) (← links)
- Combination algorithms for Steiner tree variants (Q2700384) (← links)
- Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs (Q3012847) (← links)
- Approximating Survivable Networks with Minimum Number of Steiner Points (Q3075458) (← links)
- Approximating Steiner Trees and Forests with Minimum Number of Steiner Points (Q3453286) (← links)
- Trees, Paths, Stars, Caterpillars and Spiders (Q3467870) (← links)
