A linear-time approximation algorithm for weighted matchings in graphs
From MaRDI portal
Recommendations
Cited in
(36)- Linear programming in the semi-streaming model with application to the maximum matching problem
- Linear time approximation algorithms for~degree~constrained subgraph problems
- Vertex-Weighted Matching in Two-Directional Orthogonal Ray Graphs
- A heuristic for Dijkstra's algorithm with many targets and its use in weighted matching algorithms
- scientific article; zbMATH DE number 1982180 (Why is no real title available?)
- Weighted matching in the semi-streaming model
- An algorithm for weighted fractional matroid matching
- Efficient sub-5 approximations for minimum dominating sets in unit disk graphs
- Distributed approximation for maximum weight matching on bounded degree bounded integer weight graphs
- Near-linear time algorithm for \(n\)-fold ILPs via color coding
- Adaptive AMG with coarsening based on compatible weighted matching
- Approximating the Metric TSP in Linear Time
- A simple approximation algorithm for the weighted matching problem
- Approximation algorithms in combinatorial scientific computing
- New approximation results on graph matching and related problems
- Improved linear time approximation algorithms for weighted matchings
- Engineering Algorithms for Approximate Weighted Matching
- Fast and Simple Algorithms for Weighted Perfect Matching
- scientific article; zbMATH DE number 4116586 (Why is no real title available?)
- A simple PTAS for weighted matroid matching on strongly base orderable matroids
- Linear-time approximation for maximum weight matching
- scientific article; zbMATH DE number 3902700 (Why is no real title available?)
- Approximation algorithms for weighted matching
- Shifting coresets: obtaining linear-time approximations for unit disk graphs and other geometric intersection graphs
- A simple PTAS for weighted matroid matching on strongly base orderable matroids
- Some graph optimization problems with weights satisfying linear constraints
- Near approximation of maximum weight matching through efficient weight reduction
- A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching
- scientific article; zbMATH DE number 7561568 (Why is no real title available?)
- On two-machine flow shop scheduling
- Approximating the metric TSP in linear time
- A \(2/3\)-approximation algorithm for vertex-weighted matching
- Approximating weighted matchings in parallel
- Efficient approximation algorithms for weighted \(b\)-matching
- A 2/3-approximation algorithm for vertex weighted matching in bipartite graphs
- Solving maximum weighted matching on large graphs with deep reinforcement learning
This page was built for publication: A linear-time approximation algorithm for weighted matchings in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944492)
