The following pages link to (Q4828915):
Displaying 16 items.
- On fixed cost \(k\)-flow problems (Q260248) (← links)
- Multi-rooted greedy approximation of directed Steiner trees with applications (Q262265) (← links)
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q344954) (← links)
- Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
- Approximation algorithms for multicast routing in ad hoc wireless networks (Q491195) (← links)
- Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
- Register loading via linear programming (Q494793) (← links)
- Homogeneous 2-hop broadcast in 2D (Q1037783) (← links)
- Clearing directed subgraphs by mobile agents. Variations on covering with paths (Q1741492) (← links)
- The Steiner tree in \(K_{1,r}\)-free split graphs -- a dichotomy (Q2181262) (← links)
- On the edge capacitated Steiner tree problem (Q2218647) (← links)
- The polymatroid Steiner problems (Q2569165) (← links)
- A greedy approximation algorithm for the group Steiner problem (Q2581556) (← links)
- Complexity of Steiner Tree in Split Graphs - Dichotomy Results (Q2795958) (← links)
- Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks (Q3404476) (← links)
- Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems (Q5085153) (← links)
