The following pages link to (Q4250182):
Displayed 17 items.
- Directed Steiner trees with diffusion costs (Q346492) (← links)
- An approximation algorithm for the \(k\)-level concentrator location problem (Q408401) (← links)
- GMPLS label space minimization through hypergraph layouts (Q442249) (← links)
- Approximation algorithms for multicast routing in ad hoc wireless networks (Q491195) (← links)
- Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems (Q1026247) (← links)
- Approximating the weight of shallow Steiner trees (Q1296580) (← links)
- Bayesian generalized network design (Q2202025) (← links)
- Subjectively interesting connecting trees and forests (Q2218354) (← links)
- On the edge capacitated Steiner tree problem (Q2218647) (← links)
- Augmenting weighted graphs to establish directed point-to-point connectivity (Q2359805) (← links)
- Steiner Problems with Limited Number of Branching Nodes (Q2868654) (← links)
- Approximability of unsplittable shortest path routing problems (Q3057101) (← links)
- Designing Hypergraph Layouts to GMPLS Routing Strategies (Q3408160) (← links)
- Algorithms for a network design problem with crossing supermodular demands (Q4474300) (← links)
- Graph Clustering using Effective Resistance (Q4993308) (← links)
- (Q5002844) (← links)
- (Q5075788) (← links)