scientific article; zbMATH DE number 7650127
From MaRDI portal
Publication:5875520
DOI10.4230/LIPIcs.APPROX-RANDOM.2019.60MaRDI QIDQ5875520
Svante Janson, Gregory B. Sorkin
Publication date: 3 February 2023
Full work available at URL: https://arxiv.org/abs/1906.01533
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
discrete probabilityinhomogeneous random graphoptimization in random structuressecond-cheapest structuremiminum spanning treemulti-type bra
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- An easy proof of the \(\zeta (2)\) limit in the random assignment problem
- On the value of a random minimum spanning tree problem
- Frugal path mechanisms
- Successive shortest paths in complete graphs with random edge weights
- Average-Case Analyses of Vickrey Costs
- On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph
- A proof of a conjecture of Buck, Chan, and Robbins on the expected value of the minimum assignment
- The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph
- The birth of the giant component
- The phase transition in inhomogeneous random graphs
- On the Length of a Random Minimum Spanning Tree
- Algorithmic Game Theory
This page was built for publication:
