scientific article; zbMATH DE number 7650127

DOI10.4230/LIPICS.APPROX-RANDOM.2019.60MaRDI QIDQ5875520FDOQ5875520

Authors: Svante Janson, Gregory B. Sorkin 

Publication date: 3 February 2023

Full work available at URL: https://arxiv.org/abs/1906.01533

Title of this publication is not available (Why is that?)

zbMATH Keywords

discrete probabilityinhomogeneous random graphoptimization in random structuressecond-cheapest structuremiminum spanning treemulti-type bra

Mathematics Subject Classification ID

Randomized algorithms (68W20) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Algorithmic Game Theory
• The phase transition in inhomogeneous random graphs
• Title not available (Why is that?)
• The birth of the giant component
• 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
• Title not available (Why is that?)
• An easy proof of the \(\zeta (2)\) limit in the random assignment problem
• On the value of a random minimum spanning tree problem
• The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph
• Title not available (Why is that?)
• Frugal path mechanisms
• On the length of a random minimum spanning tree
• Successive shortest paths in complete graphs with random edge weights
• Average-Case Analyses of Vickrey Costs

Cited In (2)

• Note on the structure of Kruskal's algorithm
• Successive minimum spanning trees

This page was built for publication:

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