Pages that link to "Item:Q2729645"

The following pages link to Approximation algorithms for dispersion problems (Q2729645):

Displaying 29 items.

• Construction and improvement algorithms for dispersion problems (Q726217) (← links)
• Exact algorithms for the max-min dispersion problem (Q777304) (← links)
• Approximate solutions of continuous dispersion problems (Q816409) (← links)
• Minimum dispersion problems (Q1363766) (← links)
• Approximation algorithms for maximum dispersion (Q1375119) (← links)
• A linear time approximation scheme for computing geometric maximum \(k\)-star (Q1942028) (← links)
• New approximation algorithms for weighted maximin dispersion problem with box or ball constraints (Q2046695) (← links)
• Provable randomized rounding for minimum-similarity diversification (Q2134050) (← links)
• Result diversification by multi-objective evolutionary algorithms with theoretical guarantees (Q2152498) (← links)
• Approximability of the dispersed \(\vec{p}\)-neighbor \(k\)-supplier problem (Q2217474) (← links)
• Dispersing and grouping points on planar segments (Q2232600) (← links)
• A hybrid metaheuristic method for the maximum diversity problem (Q2356110) (← links)
• Iterated tabu search for the maximum diversity problem (Q2381330) (← links)
• An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs (Q2391186) (← links)
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
• A review on algorithms for maximum clique problems (Q2630214) (← links)
• A review on discrete diversity and dispersion maximization from an OR perspective (Q2670513) (← links)
• Approximation algorithms for spreading points (Q3445959) (← links)
• Heuristic and Special Case Algorithms for Dispersion Problems (Q4301294) (← links)
• Efficient Approximations for the Online Dispersion Problem (Q4634023) (← links)
• Facility dispersion and remote subgraphs (Q5054806) (← links)
• (Q5091024) (← links)
• Efficient Approximations for the Online Dispersion Problem (Q5111340) (← links)
• Approximation Guarantees for Max Sum and Max Min Facility Dispersion with Parameterised Triangle Inequality and Applications in Result Diversification (Q5274808) (← links)
• Approximation and Online Algorithms (Q5713451) (← links)
• Max-min dispersion on a line (Q5918519) (← links)
• Approximation of geometric dispersion problems (Q5945923) (← links)
• Away from each other (Q6091146) (← links)
• The dispersive art gallery problem (Q6092310) (← links)