Pages that link to "Item:Q4651542"

The following pages link to Quick <i>k</i>-Median, <i>k</i>-Center, and Facility Location for Sparse Graphs (Q4651542):

Displaying 11 items.

• A distributed O(1)-approximation algorithm for the uniform facility location problem (Q528857) (← links)
• Small space representations for metric min-sum \(k\)-clustering and their applications (Q968274) (← links)
• A sublinear-time approximation scheme for bin packing (Q1034628) (← links)
• Near-optimal clustering in the \(k\)-machine model (Q2062125) (← links)
• Map graphs having witnesses of large girth (Q2632022) (← links)
• Sublinear-time Algorithms (Q4933363) (← links)
• Probabilistic smallest enclosing ball in high dimensions via subgradient sampling (Q5088979) (← links)
• (Q5090476) (← links)
• (Q5091075) (← links)
• Decomposition of Map Graphs with Applications. (Q5091217) (← links)
• Book embeddings of \(k\)-framed graphs and \(k\)-map graphs (Q6080147) (← links)