Stochastic analysis of partitioning algorithms for matching problems

DOI10.1239/JAP/1014842552zbMATH Open0967.60040OpenAlexW1997782951MaRDI QIDQ4519111

Ludger Rüschendorf, G. Sachs

Publication date: 30 August 2001

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/314fbf3b794cb02f8fab91548fd8a29adba00422

zbMATH Keywords

optimal matchingdissection algorithmKarp's algorithmquasiadditive functionals

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Limit theorems in probability theory (60F99)

Related Items (1)

Partitions-requirements-matrices as optimal Markov kernels of special stochastic dynamic distance optimal partitioning problems

Recommendations

• Title not available (Why is that?) 👍 👎
• On the analysis of stochastic divide and conquer algorithms 👍 👎
• Analysis of algorithms for a class of continuous partition problems 👍 👎
• Improved analysis of the greedy algorithm for stochastic matching 👍 👎
• Stability and efficiency of partitions in matching problems 👍 👎
• Improved Approximation Algorithms for Stochastic Matching 👍 👎
• Probabilistic analysis of optimum partitioning 👍 👎
• On the Two-Stage Stochastic Graph Partitioning Problem 👍 👎
• Approximation algorithms for semi-random partitioning problems 👍 👎

This page was built for publication: Stochastic analysis of partitioning algorithms for matching problems

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