The following pages link to (Q4664045):
Displaying 16 items.
- The root location problem for arc-disjoint arborescences (Q442209) (← links)
- Leader localization in multi-agent systems subject to failure: a graph-theoretic approach (Q642928) (← links)
- Maximum-cover source location problems with objective edge-connectivity three (Q836873) (← links)
- Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs (Q848841) (← links)
- Source location with rigidity and tree packing requirements (Q867918) (← links)
- Minimum cost source location problem with local 3-vertex-connectivity requirements (Q870842) (← links)
- Static and dynamic source locations in undirected networks (Q889101) (← links)
- Minimizing a monotone concave function with laminar covering constraints (Q943837) (← links)
- Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs (Q1044047) (← links)
- Blocking unions of arborescences (Q1751195) (← links)
- An algorithm for source location in directed graphs (Q1779694) (← links)
- Minimum cost source location problems with flow requirements (Q2482728) (← links)
- Approximating Source Location and Star Survivable Network Problems (Q2827812) (← links)
- Deterministic flow-demand location problems (Q4345520) (← links)
- Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs (Q5387743) (← links)
- Posimodular function optimization (Q5918641) (← links)