Pages that link to "Item:Q2581556"
From MaRDI portal
The following pages link to A greedy approximation algorithm for the group Steiner problem (Q2581556):
Displayed 15 items.
- On fixed cost \(k\)-flow problems (Q260248) (← links)
- Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
- Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Tour recommendation for groups (Q1741326) (← links)
- On a class of branching problems in broadcasting and distribution (Q1761092) (← links)
- Approximation algorithms for the connected sensor cover problem (Q2290655) (← links)
- Affinity-driven blog cascade analysis and prediction (Q2435723) (← links)
- Approximating the two-level facility location problem via a quasi-greedy approach (Q2494518) (← links)
- The polymatroid Steiner problems (Q2569165) (← links)
- Combination algorithms for Steiner tree variants (Q2700384) (← links)
- Bounded Degree Group Steiner Tree Problems (Q5041204) (← links)
- Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems (Q5085153) (← links)
- Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems (Q5210996) (← links)
- $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm (Q5890148) (← links)