The following pages link to Dynamic Steiner Tree Problem (Q3977293):
Displaying 50 items.
- Average competitive ratios of on-line spanning trees (Q287071) (← links)
- Online network design with outliers (Q334928) (← links)
- A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees (Q388463) (← links)
- Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
- Volume in general metric spaces (Q464741) (← links)
- On-line Steiner trees in the Euclidean plane (Q685176) (← links)
- Bayesian ignorance (Q714780) (← links)
- A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem (Q727979) (← links)
- Tight bounds for online weighted tree augmentation (Q832514) (← links)
- When ignorance helps: graphical multicast cost sharing games (Q844895) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Heuristics for the Steiner problem in graphs (Q1199447) (← links)
- The competitiveness of randomized algorithms for on-line Steiner tree and on-line spanning tree problems (Q1313740) (← links)
- Not all insertion methods yield constant approximate tours in the Euclidean plane (Q1318697) (← links)
- Constructing competitive tours from local information (Q1331954) (← links)
- Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors (Q1343464) (← links)
- Competitive distributed file allocation. (Q1427858) (← links)
- The dynamic predicate stashing copy problem and the Steiner problem in graphs (Q1582038) (← links)
- Swap-vertex based neighborhood for Steiner tree problems (Q1699620) (← links)
- Online constrained forest and prize-collecting network design (Q1755747) (← links)
- Minimization of multicast traffic and ensuring its fault tolerance in software-defined networks (Q1792411) (← links)
- New results for online page replication (Q1887086) (← links)
- On-line generalized Steiner problem (Q1887091) (← links)
- An average case analysis of a greedy algorithm for the on-line Steiner tree problem (Q1921250) (← links)
- A fast distributed approximation algorithm for minimum spanning trees (Q1954259) (← links)
- On approximations for constructing 1-line minimum rectilinear Steiner trees in the Euclidean plane \(\mathbb{R}^2\) (Q2039643) (← links)
- \(1\)-line minimum rectilinear Steiner trees and related problems (Q2084647) (← links)
- Online load balancing with general reassignment cost (Q2157902) (← links)
- Group parking permit problems (Q2184679) (← links)
- Timing matters: online dynamics in broadcast games (Q2190382) (← links)
- Parameterized analysis of the online priority and node-weighted Steiner tree problems (Q2322716) (← links)
- On the convergence of multicast games in directed networks (Q2379922) (← links)
- A survey of combinatorial optimization problems in multicast routing (Q2387246) (← links)
- A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms (Q2456363) (← links)
- On the competitive ratio for online facility location (Q2471804) (← links)
- Effective multicasting algorithm for dynamic membership with delay constraint (Q2508107) (← links)
- Pushing the online Boolean matrix-vector multiplication conjecture off-line and identifying its easy cases (Q2656173) (← links)
- Non-greedy online Steiner trees on outerplanar graphs (Q2659774) (← links)
- Approximation algorithms for priority Steiner tree problems (Q2695278) (← links)
- Equilibria in online games (Q2796211) (← links)
- Non-greedy Online Steiner Trees on Outerplanar Graphs (Q2971163) (← links)
- An O(logn)-Competitive Algorithm for Online Constrained Forest Problems (Q3012790) (← links)
- THE EFFECT OF ASYMMETRY ON THE ON-LINE MULTICAST ROUTING PROBLEM (Q3021994) (← links)
- Oblivious Buy-at-Bulk in Planar Graphs (Q3078378) (← links)
- Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs (Q3088084) (← links)
- The Push Tree problem (Q3157036) (← links)
- Online Priority Steiner Tree Problems (Q3183439) (← links)
- From Cost Sharing Mechanisms to Online Selection Problems (Q3449447) (← links)
- The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online (Q3460333) (← links)
- A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry (Q3541076) (← links)
