Pages that link to "Item:Q3922185"

The following pages link to On a Greedy Heuristic for Complete Matching (Q3922185):

Displaying 27 items.

• A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching (Q476428) (← links)
• Random shortest paths: non-Euclidean instances for metric optimization problems (Q494931) (← links)
• A partitioning algorithm for minimum weighted Euclidean matching (Q794175) (← links)
• Greedy matching on a grid (Q921922) (← links)
• A lower bound to the complexity of Euclidean and rectilinear matching algorithms (Q1072708) (← links)
• Recurrence relations based on minimization and maximization (Q1079343) (← links)
• On the existence of weak greedy matching heuristics (Q1080871) (← links)
• Approximation algorithms for weighted matching (Q1102118) (← links)
• Worst case bounds for the Euclidean matching problem (Q1149255) (← links)
• Linear-time approximation algorithms for finding the minimum-weight perfect matching on a plane (Q1152226) (← links)
• The ring of \(k\)-regular sequences (Q1193879) (← links)
• Some recent results in the analysis of greedy algorithms for assignment problems (Q1317524) (← links)
• An asymptotic theory for recurrence relations based on minimization and maximization. (Q1401173) (← links)
• A genetic-based framework for solving (multi-criteria) weighted matching problems. (Q1811148) (← links)
• Heuristic methods and applications: A categorized survey (Q1823879) (← links)
• New primal and dual matching heuristics (Q1891231) (← links)
• A \(o(n)\)-competitive deterministic algorithm for online matching on a line (Q2415368) (← links)
• Probabilistic analysis of optimization problems on generalized random shortest path metrics (Q2662688) (← links)
• Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
• Probabilistic Analysis of a Greedy Heuristic for Euclidean Matching (Q3415878) (← links)
• Fast and Simple Algorithms for Weighted Perfect Matching (Q3439168) (← links)
• The Price of Matching with Metric Preferences (Q3452808) (← links)
• A $$o(n)$$-Competitive Deterministic Algorithm for Online Matching on a Line (Q3453279) (← links)
• AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗ (Q4820048) (← links)
• (Q5091241) (← links)
• Deterministic min-cost matching with delays (Q5916084) (← links)
• Probabilistic analysis of optimization problems on sparse random shortest path metrics (Q6088299) (← links)