Engineering Algorithms for Approximate Weighted Matching
From MaRDI portal
Publication:5432319
DOI10.1007/978-3-540-72845-0_19zbMath1203.68317OpenAlexW2138508044MaRDI QIDQ5432319
Publication date: 2 January 2008
Published in: Experimental Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72845-0_19
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (10)
Local search for constrained graph clustering in biological networks ⋮ Parallel Weighted Random Sampling ⋮ A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs ⋮ Dynamic Matching Algorithms in Practice ⋮ A \(2/3\)-approximation algorithm for vertex-weighted matching ⋮ Efficient Matching for Column Intersection Graphs ⋮ Advanced Coarsening Schemes for Graph Partitioning ⋮ Approximation algorithms in combinatorial scientific computing ⋮ Efficient Approximation Algorithms for Weighted $b$-Matching ⋮ Tree-Based Coarsening and Partitioning of Complex Networks
This page was built for publication: Engineering Algorithms for Approximate Weighted Matching
