The following pages link to (Q3138951):
Displaying 39 items.
- Bounded fan-out \(m\)-center problem (Q287146) (← links)
- Improved algorithms for path partition and related problems (Q408433) (← links)
- New algorithms for facility location problems on the real line (Q517797) (← links)
- Fitting a step function to a point set (Q547281) (← links)
- A tight bound on the min-ratio edge-partitioning problem of a tree (Q608252) (← links)
- Minimum \(L_k\) path partitioning-an illustration of the Monge property (Q924884) (← links)
- Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches (Q972328) (← links)
- Center location problems on tree graphs with subtree-shaped customers (Q1005232) (← links)
- On some geometric selection and optimization problems via sorted matrices (Q1265327) (← links)
- Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications (Q1338956) (← links)
- Getting around a lower bound for the minimum Hausdorff distance (Q1392850) (← links)
- Continuous bottleneck tree partitioning problems (Q1827846) (← links)
- A linear-time algorithm for finding an edge-partition with max-min ratio at most two (Q1949099) (← links)
- Partitioning a graph into balanced connected classes: formulations, separation and experiments (Q2030323) (← links)
- Scheduling with gaps: new models and algorithms (Q2059088) (← links)
- Approximation algorithms for the maximally balanced connected graph tripartition problem (Q2082191) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Approximation algorithms for the maximum bounded connected bipartition problem (Q2151359) (← links)
- Computing \(k\)-centers of uncertain points on a real line (Q2157899) (← links)
- Linear-time fitting of a \(k\)-step function (Q2181242) (← links)
- Approximating points by a piecewise linear function (Q2375945) (← links)
- Two new algorithms for the min-power broadcast problem in static ad hoc networks (Q2383911) (← links)
- Linear-Time Fitting of a k-Step Function (Q2795937) (← links)
- Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane (Q2988724) (← links)
- Fitting a Step Function to a Point Set (Q3541106) (← links)
- Approximations for the general block distribution of a matrix (Q5054840) (← links)
- Improvements on geometric pattern matching problems (Q5056151) (← links)
- On some geometric selection and optimization problems via sorted matrices (Q5057419) (← links)
- (Q5111728) (← links)
- An O(n log n)-Time Algorithm for the k-Center Problem in Trees (Q5116532) (← links)
- An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees (Q5858648) (← links)
- Algorithms for covering multiple barriers (Q5916077) (← links)
- Approximation algorithms for maximally balanced connected graph partition (Q5918464) (← links)
- Max-min dispersion on a line (Q5918519) (← links)
- Approximations for the general block distribution of a matrix (Q5958117) (← links)
- Approximation and parameterized algorithms for balanced connected partition problems (Q6102278) (← links)
- Faster distance-based representative skyline and \(k\)-center along Pareto front in the plane (Q6162513) (← links)
- Balanced connected partitions of graphs: approximation, parameterization and lower bounds (Q6166191) (← links)
- Dispersion problem on a convex polygon (Q6602315) (← links)
