Probabilistic analysis of optimization problems on sparse random shortest path metrics (Q6088299): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-023-01167-3 / rank
Normal rank
 
Property / cites work
 
Property / cites work: 50 Years of First-Passage Percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper (lower) bounds on the mean of the maximum (minimum) of a number of random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Analysis of a Greedy Heuristic for Euclidean Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Not all insertion methods yield constant approximate tours in the Euclidean plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3669332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-isoperimetric inequalities in the grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering properties of convolutions of exponential random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random shortest paths: non-Euclidean instances for metric optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on the Old <i>k</i>-opt Algorithm for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expected length of a shortest path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-case approximation ratio of the 2-opt algorithm for the TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Random Symmetric Travelling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Shortest Paths in Graphs with Random Weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander graphs and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4450067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One, Two and Three Times log <i>n</i>/<i>n</i> for Paths in a Complete Graph with Random Weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tail bounds for sums of geometric and exponential variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of optimization problems on generalized random shortest path metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman. Computational solutions for RSP applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Greedy Heuristic for Complete Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4048450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5306025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Expected Value of a Random Assignment Problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-023-01167-3 / rank
 
Normal rank

Latest revision as of 18:19, 30 December 2024

scientific article; zbMATH DE number 7777572
Language Label Description Also known as
English
Probabilistic analysis of optimization problems on sparse random shortest path metrics
scientific article; zbMATH DE number 7777572

    Statements

    Probabilistic analysis of optimization problems on sparse random shortest path metrics (English)
    0 references
    0 references
    0 references
    0 references
    13 December 2023
    0 references
    random shortest path metrics
    0 references
    first-passage percolation
    0 references
    approximation algorithms
    0 references
    probabilistic analysis
    0 references
    average-case analysis
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers