A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems

DOI10.1007/978-3-642-04944-6_8MaRDI QIDQ3646120zbMATH OpenOpenAlexFDO

Authors Ei Ando, Hirotaka Ono, Masafumi Yamashita

Publication date 19 November 2009

Published in Stochastic Algorithms: Foundations and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04944-6_8

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Stochastic programming (90C15) Approximation algorithms (68W25) Combinatorial probability (60C05)

Recommendations

• Maximization problems on graphs with edge weights chosen from a normal distribution (extended abstract)
• Probabilistic Combinatorial Optimization on Graphs
• Stochastic Shortest Paths Via Quasi-convex Maximization
• Stochastic minimum spanning trees and related problems
• Probabilistic optimization in graph-problems

Cites work

• scientific article; zbMATH DE number 3112231 (Why is no real title available?)
• scientific article; zbMATH DE number 3547074 (Why is no real title available?)
• scientific article; zbMATH DE number 1839431 (Why is no real title available?)
• scientific article; zbMATH DE number 3326387 (Why is no real title available?)
• A computational study on bounding the makespan distribution in stochastic project networks
• A minimum spanning tree algorithm with inverse-Ackermann type complexity
• Application of a technique for research and development program evaluation
• Approximating probability density functions and their convolutions using orthogonal polynomials
• Approximating the longest path length of a stochastic DAG by a normal distribution in linear time
• Bounding Distributions for a Stochastic Acyclic Network
• Bounding the Project Completion Time Distribution in PERT Networks
• Distribution of the Time Through a Directed, Acyclic Network
• Hedging uncertainty: approximation algorithms for stochastic optimization problems
• Stochastic spanning tree problem

Cited in

(3)

• scientific article; zbMATH DE number 558545 (Why is no real title available?)
• scientific article; zbMATH DE number 1857640 (Why is no real title available?)
• Methodology for Stochastic Graph Completion-Time Problems

This page was built for publication: A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems

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