Matroid matching: the power of local search
type: Item
instance of: scholarly article
zbMATH Open document ID: 1293.05035
DOI: 10.1145/1806689.1806741
author: Jon Lee
author: Maxim Sviridenko
author: Jan Vondrák
published in: Proceedings of the forty-second ACM symposium on Theory of computing
publication date: 2014-08-13T00:00:00Z
Mathematics Subject Classification ID: 05B35
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6330076
zbMATH Keywords: Sherali-Adams hierarchy
zbMATH Keywords: local search
zbMATH Keywords: matching
zbMATH Keywords: matroid
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1145/1806689.1806741
OpenAlex ID: W2027229272
Recommended article: Matroid matching: the power of local search
Recommended article: The power of local search: maximum coverage over a matroid
Recommended article: Strict matching matroids and matroid algorithms
Recommended article: Generalized matroid matching
Recommended article: Q3576684
Recommended article: Matroid matching with Dilworth truncation
Recommended article: A Local Computation Approximation Scheme to Maximum Matching
Recommended article: Matroid matching in pseudomodular lattices
Recommended article: Locally searching for large induced matchings
Recommended article: Matching, matroids, and extensions
title: Matroid matching: the power of local search
description: scientific article; zbMATH DE number 6330076