Pages that link to "Item:Q3332259"

The following pages link to Heuristic matching for graphs satisfying the triangle inequality (Q3332259):

Displaying 7 items.

• A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching (Q476428) (← links)
• A generalized hypergreedy algorithm for weighted perfect matching (Q688623) (← 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 greedy heuristic for a minimum-weight forest problem (Q1317004) (← links)
• Heuristic methods and applications: A categorized survey (Q1823879) (← links)
• Approximate minimum weight matching on points in k-dimensional space (Q1825658) (← links)