The following pages link to (Q4952699):
Displaying 50 items.
- Improved algorithms for joint optimization of facility locations and network connections (Q322548) (← links)
- Directed Steiner trees with diffusion costs (Q346492) (← links)
- The density maximization problem in graphs (Q386420) (← links)
- On the low-dimensional Steiner minimum tree problem in Hamming metric (Q393125) (← links)
- On the approximability of dense Steiner problems (Q396661) (← links)
- Steiner tree reoptimization in graphs with sharpened triangle inequality (Q414457) (← links)
- Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
- Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem (Q621842) (← links)
- Approximating capacitated tree-routings in networks (Q630195) (← links)
- A note on optical network with nonsplitting nodes (Q813337) (← links)
- Reoptimization of Steiner trees: changing the terminal set (Q838156) (← links)
- A better constant-factor approximation for selected-internal Steiner minimum tree (Q848949) (← links)
- Node-weighted Steiner tree approximation in unit disk graphs (Q849134) (← links)
- A factoring approach for the Steiner tree problem in undirected networks (Q881873) (← links)
- An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 (Q891823) (← links)
- Approximation algorithms for general packing problems and their application to the multicast congestion problem (Q925266) (← links)
- Inapproximability and approximability of minimal tree routing and coloring (Q935848) (← links)
- On routing in VLSI design and communication networks (Q944702) (← links)
- The Steiner tree problem on graphs: inapproximability results (Q952442) (← links)
- Cooperative TSP (Q982655) (← links)
- On the approximation of the generalized capacitated tree-routing problem (Q988692) (← links)
- Approximating the selected-internal Steiner tree (Q995588) (← links)
- On Rajagopalan and Vazirani's \(\frac{3}{2}e\)-approximation bound for the iterated 1-Steiner heuristic (Q1007642) (← links)
- A note on the terminal Steiner tree problem (Q1014425) (← links)
- Approximation algorithms for connected facility location problems (Q1016041) (← links)
- Packing trees in communication networks (Q1016048) (← links)
- Non-cooperative tree creation (Q1017908) (← links)
- Approximation algorithms for soft-capacitated facility location in capacitated network design (Q1024778) (← links)
- Improved approximation algorithms for the single-sink buy-at-bulk network design problems (Q1026237) (← links)
- Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation (Q1028460) (← links)
- On approximation algorithms for the terminal Steiner tree problem (Q1029037) (← links)
- A 3.4713-approximation algorithm for the capacitated multicast tree routing problem (Q1040584) (← links)
- A 6.55 factor primal-dual approximation algorithm for the connected facility location problem (Q1041431) (← links)
- Improved computation of plane Steiner minimal trees (Q1186797) (← links)
- On the approximability of the Steiner tree problem. (Q1401253) (← links)
- Differential approximation results for the Steiner tree problem (Q1431874) (← links)
- On approximability of the independent/connected edge dominating set problems (Q1603390) (← links)
- On residual approximation in solution extension problems (Q1631675) (← links)
- Improved upper bounds for the Steiner ratio (Q1662104) (← links)
- Steiner trees in uniformly quasi-bipartite graphs. (Q1853068) (← links)
- On the terminal Steiner tree problem. (Q1853109) (← links)
- Improved methods for approximating node weighted Steiner trees and connected dominating sets. (Q1854264) (← links)
- Improved Steiner tree algorithms for bounded treewidth (Q1932355) (← links)
- Two-stage robust network design with exponential scenarios (Q1939662) (← links)
- Wireless networking, dominating and packing (Q1958633) (← links)
- Connected facility location via random facility sampling and core detouring (Q1959419) (← links)
- Load balanced distributed directories (Q2139097) (← links)
- On the edge capacitated Steiner tree problem (Q2218647) (← links)
- Distributed transactional memory for general networks (Q2256963) (← links)
- A near linear time approximation scheme for Steiner tree among obstacles in the plane (Q2269141) (← links)
