Pages that link to "Item:Q1887091"
From MaRDI portal
The following pages link to On-line generalized Steiner problem (Q1887091):
Displaying 20 items.
- Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
- Tight bounds for online weighted tree augmentation (Q832514) (← links)
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Online constrained forest and prize-collecting network design (Q1755747) (← 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)
- Non-greedy online Steiner trees on outerplanar graphs (Q2659774) (← links)
- Non-greedy Online Steiner Trees on Outerplanar Graphs (Q2971163) (← links)
- An O(logn)-Competitive Algorithm for Online Constrained Forest Problems (Q3012790) (← links)
- Online Priority Steiner Tree Problems (Q3183439) (← 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)
- (Q5002841) (← links)
- Tight Bounds for Online Weighted Tree Augmentation (Q5091248) (← links)
- Dynamic Balanced Graph Partitioning (Q5130579) (← links)
- Designing Networks with Good Equilibria under Uncertainty (Q5232329) (← links)
- Online Node-weighted Steiner Forest and Extensions via Disk Paintings (Q5737814) (← links)
- Online Spanners in Metric Spaces (Q6195959) (← links)
