Pages that link to "Item:Q3189636"
From MaRDI portal
The following pages link to Linear-Time Approximation for Maximum Weight Matching (Q3189636):
Displaying 43 items.
- Minimum cost input/output design for large-scale linear structural systems (Q274009) (← links)
- Faster approximation algorithms for maximizing a monotone submodular function subject to a \(b\)-matching constraint (Q284354) (← links)
- Structural minimum controllability problem for switched linear continuous-time systems (Q518318) (← links)
- Euclidean maximum matchings in the plane -- local to global (Q832859) (← links)
- Costly circuits, submodular schedules and approximate Carathéodory theorems (Q1649974) (← links)
- On improving matchings in trees, via bounded-length augmentations (Q1801054) (← links)
- A \(2/3\)-approximation algorithm for vertex-weighted matching (Q2064284) (← links)
- Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers (Q2149100) (← links)
- Two dimensional maximum weight matching using Manhattan topology (Q2157895) (← links)
- Classes of linear programs solvable by coordinate-wise minimization (Q2163850) (← links)
- Matching and scheduling of student-company-talks for a university it-speed dating event (Q2167666) (← links)
- The power of linear-time data reduction for maximum matching (Q2211355) (← links)
- Structurally quotient fixed modes (Q2243011) (← links)
- Exact and approximation algorithms for weighted matroid intersection (Q2316615) (← links)
- Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and \(=(1/\varepsilon)\)-convergence (Q2414908) (← links)
- Advice complexity of online non-crossing matching (Q2678256) (← links)
- Efficient approximation algorithms for weighted \(b\)-matching (Q2830632) (← links)
- An efficient NC algorithm for approximate maximum weight matching (Q2864855) (← links)
- Near Approximation of Maximum Weight Matching through Efficient Weight Reduction (Q3010385) (← links)
- Approximating Spectral Clustering via Sampling: A Review (Q3297374) (← links)
- Fully Dynamic Matching in Bipartite Graphs (Q3448782) (← links)
- Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality (Q3604573) (← links)
- A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (Q4561265) (← links)
- Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching (Q4571920) (← links)
- Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs (Q4605337) (← links)
- A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs (Q4623143) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- Dynamic matching: reducing integral algorithms to approximately-maximal fractional algorithms (Q5002673) (← links)
- Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments (Q5009617) (← links)
- Data Reduction for Maximum Matching on Real-World Graphs (Q5102046) (← links)
- The Power of Linear-Time Data Reduction for Maximum Matching (Q5111261) (← links)
- The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs (Q5111716) (← links)
- Fast matching-based approximations for maximum duo-preservation string mapping and its weighted variant (Q5140766) (← links)
- Approximation algorithms in combinatorial scientific computing (Q5230524) (← links)
- Approximate Matching in Weighted Sequences (Q5307520) (← links)
- On conceptually simple algorithms for variants of online bipartite matching (Q5915658) (← links)
- Maximum bipartite matchings with low rank data: locality and perturbation analysis (Q5964024) (← links)
- (Q6062163) (← links)
- Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks (Q6096038) (← links)
- Recovery of disrupted airline operations using \(k\)-maximum matching in graphs (Q6167856) (← links)
- Estimating optimal objective values for the TSP, VRP, and other combinatorial problems using randomization (Q6495409) (← links)
- Minimum jointly structural input and output selection (Q6566753) (← links)
- Euclidean maximum matchings in the plane -- local to global (Q6670815) (← links)