Pages that link to "Item:Q3189000"
From MaRDI portal
The following pages link to Set connectivity problems in undirected graphs and the directed steiner network problem (Q3189000):
Displaying 15 items.
- Approximation algorithms for orienting mixed graphs (Q390889) (← links)
- On minimum generalized Manhattan connections (Q832842) (← links)
- Approximation algorithm for the partial set multi-cover problem (Q2010112) (← links)
- Bayesian generalized network design (Q2202025) (← links)
- Approximation algorithms for constructing some required structures in digraphs (Q2255946) (← links)
- The subdivision-constrained routing requests problem (Q2436672) (← links)
- Balls and Funnels: Energy Efficient Group-to-Group Anycasts (Q2817865) (← links)
- Online Buy-at-Bulk Network Design (Q4577806) (← links)
- Spider Covering Algorithms for Network Design Problems (Q4689626) (← links)
- ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network (Q4993301) (← links)
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← links)
- (Q5075788) (← links)
- Complexity of the Steiner Network Problem with Respect to the Number of Terminals (Q5090473) (← links)
- How to Secure Matchings against Edge Failures (Q5157391) (← links)
- Reachability Preservers: New Extremal Bounds and Approximation Algorithms (Q6154193) (← links)
