Stochastic Minimum Spanning Trees and Related Problems

From MaRDI portal

Revision as of 16:36, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5194696

Jump to:navigation, search

DOI10.1137/1.9781611973013.12zbMath1430.68117OpenAlexW2239248271MaRDI QIDQ5194696

Pegah Kamousi, Subhash Suri

Publication date: 16 September 2019

Published in: 2011 Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973013.12

Mathematics Subject Classification ID

Stochastic programming (90C15) Graph theory (including graph drawing) in computer science (68R10) Stochastic network models in operations research (90B15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (2)

Counting polygon triangulations is hard ⋮ Unnamed Item

This page was built for publication: Stochastic Minimum Spanning Trees and Related Problems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5194696&oldid=19778146"