Multi-commodity Source Location Problems and Price of Greed
From MaRDI portal
Publication:5452163
DOI10.1007/978-3-540-77891-2_16zbMATH Open1132.90343OpenAlexW2104063661MaRDI QIDQ5452163FDOQ5452163
Authors: Hiro Ito, Kenya Sugihara, Mike Paterson
Publication date: 25 March 2008
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77891-2_16
Recommendations
- The Multi-Commodity Source Location Problems and the Price of Greed
- Maximum-cover source location problems with objective edge-connectivity three
- Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs
- Non-cooperative Facility Location and Covering Games
- Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs
Cites Work
- The Price of Stability for Network Design with Fair Cost Allocation
- The effect of collusion in congestion games
- Locating sources to meet flow demands in undirected networks
- Minimum cost source location problem with vertex-connectivity requirements in digraphs
- Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three
- Source location problems considering vertex-connectivity and edge-connectivity simultaneously
- Transversals of subtree hypergraphs and the source location problem in digraphs
Cited In (2)
This page was built for publication: Multi-commodity Source Location Problems and Price of Greed
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452163)