Pages that link to "Item:Q2462389"
From MaRDI portal
The following pages link to The source location problem with local 3-vertex-connectivity requirements (Q2462389):
Displaying 11 items.
- Maximum-cover source location problems with objective edge-connectivity three (Q836873) (← links)
- Minimum cost source location problem with local 3-vertex-connectivity requirements (Q870842) (← links)
- Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs (Q1044047) (← links)
- Minimum cost source location problem with vertex-connectivity requirements in digraphs (Q1607133) (← links)
- An algorithm for source location in directed graphs (Q1779694) (← links)
- Approximating minimum cost source location problems with local vertex-connectivity demands (Q2434929) (← links)
- Minimum cost source location problems with flow requirements (Q2482728) (← links)
- Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands (Q3010423) (← links)
- The 3‐vertex single source Weber location problem (Q3796938) (← links)
- Source location problems considering vertex-connectivity and edge-connectivity simultaneously (Q4785221) (← links)
- Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs (Q5387743) (← links)