Optimization Problems on Graphs with Independent Random Edge Weights

DOI10.1137/0210024MaRDI QIDQ3910569zbMATH OpenOpenAlexFDO

Authors George S. Lueker

Publication date 1981

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://escholarship.org/uc/item/6wf1f973

zbMATH Keywords

Boole's inequalitygreedy algorithmsnormal distributionoptimization problemsrandom graphsweighted graphs

Mathematics Subject Classification ID

Graph theory (05C99) Combinatorial probability (60C05) Algorithms in computer science (68W99)

Cited in

(4)

• On the value of a random minimum spanning tree problem
• On Frieze's (3) limit for lengths of minimal spanning trees
• Maximal paths in random dynamic graphs
• Combinational optimization problems for which almost every algorithm is asymptotically optimal

This page was built for publication: Optimization Problems on Graphs with Independent Random Edge Weights

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3910569)