Pages that link to "Item:Q5716835"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5716835):
Displaying 15 items.
- A distributed O(1)-approximation algorithm for the uniform facility location problem (Q528857) (← links)
- Sub-logarithmic distributed algorithms for metric facility location (Q748120) (← links)
- Separating sublinear time computations by approximate diameter (Q849140) (← links)
- Small space representations for metric min-sum \(k\)-clustering and their applications (Q968274) (← links)
- Kinetic facility location (Q970606) (← links)
- A sublinear-time approximation scheme for bin packing (Q1034628) (← links)
- A concentration inequality for the facility location problem (Q2670506) (← links)
- Sublinear time algorithms for metric space problems (Q2819576) (← links)
- Approximating average parameters of graphs (Q3514701) (← links)
- Facility Location in Dynamic Geometric Data Streams (Q3541125) (← links)
- Line Segment Facility Location in Weighted Subdivisions (Q3638446) (← links)
- Sublinear-time Algorithms (Q4933363) (← links)
- (Q5009578) (← links)
- Separating Sublinear Time Computations by Approximate Diameter (Q5505645) (← links)
- Sublinear time approximation of the cost of a metric \(k\)-nearest neighbor graph (Q6491305) (← links)