On the probabilistic min spanning tree problem (Q1935723): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Probabilistic a priori routing-location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traveling Salesman Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The probabilistic minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Priori Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic graph-coloring in bipartite and split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimum spanning tree algorithm with inverse-Ackermann type complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming under Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arborescence optimization problems solvable by Edmonds' algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest path problems with node failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3799802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The probabilistic longest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A priori optimization for the probabilistic maximum independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probabilistic Minimum Vertex-covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the probabilistic minimum coloring and minimum \(k\)-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Forests on Stochastic Metric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic models for the Steiner Tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3893678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of a Good But Not Linear Set Union Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees / rank
 
Normal rank

Latest revision as of 05:36, 6 July 2024

scientific article
Language Label Description Also known as
English
On the probabilistic min spanning tree problem
scientific article

    Statements

    On the probabilistic min spanning tree problem (English)
    0 references
    0 references
    0 references
    0 references
    19 February 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    complexity
    0 references
    approximation
    0 references
    probabilistic optimization
    0 references
    spanning tree
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references