Pages that link to "Item:Q3315292"
From MaRDI portal
The following pages link to A survey of heuristics for the weighted matching problem (Q3315292):
Displaying 25 items.
- Parallel approximation algorithms for maximum weighted matching in general graphs (Q294847) (← links)
- Quotient geometric crossovers and redundant encodings (Q418019) (← links)
- Euclidean maximum matchings in the plane -- local to global (Q832859) (← links)
- A quantization framework for smoothed analysis of Euclidean optimization problems (Q893320) (← links)
- Greedy matching on a grid (Q921922) (← links)
- An analysis of a decomposition heuristic for the assignment problem (Q1062912) (← links)
- A lower bound to the complexity of Euclidean and rectilinear matching algorithms (Q1072708) (← links)
- On the existence of weak greedy matching heuristics (Q1080871) (← links)
- A new adaptive Hungarian mating scheme in genetic algorithms (Q1726046) (← links)
- Approximate minimum weight matching on points in k-dimensional space (Q1825658) (← links)
- On computing the diameter of a point set in high dimensional Euclidean space. (Q1853493) (← links)
- New primal and dual matching heuristics (Q1891231) (← links)
- Almost stable matchings by truncating the Gale-Shapley algorithm (Q1959728) (← links)
- A \(2/3\)-approximation algorithm for vertex-weighted matching (Q2064284) (← links)
- Two-way greedy: algorithms for imperfect rationality (Q2152097) (← links)
- Efficient Approximation Algorithms for Weighted $b$-Matching (Q2830632) (← links)
- Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
- Probabilistische analyse von heuristiken der kombinatorischen optimierung – ein überbllck (Q3200892) (← links)
- Probabilistic Analysis of a Greedy Heuristic for Euclidean Matching (Q3415878) (← links)
- On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices (Q3466259) (← links)
- (Q4536416) (← links)
- AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗ (Q4820048) (← links)
- Cellular automaton decoders of topological quantum memories in the fault tolerant setting (Q6098606) (← links)
- Solving simultaneous target assignment and path planning efficiently with time-independent execution (Q6108766) (← links)
- Solving maximum weighted matching on large graphs with deep reinforcement learning (Q6125273) (← links)
