On the multicriterial problem of the search for optimal sources in a graph
From MaRDI portal
Publication:2736212
zbMATH Open0985.90081MaRDI QIDQ2736212
Publication date: 29 August 2001
Published in: Izvestiya Ural'skogo Gosudarstvennogo Universiteta. Matematika i Mekhanika (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Graph algorithms (graph-theoretic aspects) (05C85)
Recommendations
- Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs π π
- On the optimality of a simple strategy for searching graphs π π
- On some algorithmic problems of multicriterion optimization on graphs π π
- Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
This page was built for publication: On the multicriterial problem of the search for optimal sources in a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2736212)