Pages that link to "Item:Q4216137"

The following pages link to AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem (Q4216137):

Displaying 17 items.

• A simple greedy approximation algorithm for the minimum connected \(k\)-center problem (Q281773) (← links)
• The connected \(p\)-center problem on block graphs with forbidden vertices (Q418726) (← links)
• The weighted \(k\)-center problem in trees for fixed \(k\) (Q2077394) (← links)
• Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs (Q2185812) (← links)
• Asymmetric \(k\)-center with minimum coverage (Q2380063) (← links)
• Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
• Client assignment problems for latency minimization (Q2424655) (← links)
• Discrete sensor placement problems in distribution networks (Q2489111) (← links)
• Asymmetry in \(k\)-center variants (Q2503348) (← links)
• Efficiently computing succinct trade-off curves (Q2581275) (← links)
• Insertion heuristics for central cycle problems (Q3057168) (← links)
• Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs (Q3088084) (← links)
• Ant colony optimization for finding medians of weighted graphs (Q4908024) (← links)
• Approximating Distance Measures for the Skyline (Q5091120) (← links)
• The Euclidean <i>k</i>-Supplier Problem (Q5108254) (← links)
• (Q5136270) (← links)
• Min-Max-Min Optimization with Smooth and Strongly Convex Objectives (Q6053591) (← links)