Pages that link to "Item:Q1607133"
From MaRDI portal
The following pages link to Minimum cost source location problem with vertex-connectivity requirements in digraphs (Q1607133):
Displayed 11 items.
- 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)
- Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs (Q860392) (← links)
- Minimum cost source location problem with local 3-vertex-connectivity requirements (Q870842) (← links)
- A note on two source location problems (Q1018105) (← links)
- Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs (Q1044047) (← links)
- The source location problem with local 3-vertex-connectivity requirements (Q2462389) (← links)
- Minimum cost source location problems with flow requirements (Q2482728) (← links)
- Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three (Q3439496) (← links)
- Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs (Q5387743) (← links)
- Multi-commodity Source Location Problems and Price of Greed (Q5452163) (← links)