Pages that link to "Item:Q5466479"

The following pages link to Automata, Languages and Programming (Q5466479):

Displaying 9 items.

• Optimal time bounds for approximate clustering (Q703075) (← links)
• Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms (Q995573) (← links)
• On parameterized approximation algorithms for balanced clustering (Q2111529) (← links)
• A framework for statistical clustering with constant time approximation algorithms for \(K\)-median and \(K\)-means clustering (Q2384132) (← links)
• Sublinear time approximate clustering (Q2768331) (← links)
• Sublinear‐time approximation algorithms for clustering via random sampling (Q3419620) (← links)
• Selective sampling for approximate clustering of very large data sets (Q5450361) (← links)
• (Q5874507) (← links)
• Maximizing the number of rides served for time-limited Dial-a-Ride* (Q6661115) (← links)