scientific article
From MaRDI portal
Publication:3138951
zbMath0800.68636MaRDI QIDQ3138951
Publication date: 20 October 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (38)
Bounded fan-out \(m\)-center problem ⋮ Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications ⋮ Approximating points by a piecewise linear function ⋮ An overview of graph covering and partitioning ⋮ Improvements on geometric pattern matching problems ⋮ Two new algorithms for the min-power broadcast problem in static ad hoc networks ⋮ Approximation algorithms for the maximum bounded connected bipartition problem ⋮ Computing \(k\)-centers of uncertain points on a real line ⋮ A tight bound on the min-ratio edge-partitioning problem of a tree ⋮ Linear-time fitting of a \(k\)-step function ⋮ Getting around a lower bound for the minimum Hausdorff distance ⋮ Improved algorithms for path partition and related problems ⋮ Approximation and parameterized algorithms for balanced connected partition problems ⋮ Faster distance-based representative skyline and \(k\)-center along Pareto front in the plane ⋮ Balanced connected partitions of graphs: approximation, parameterization and lower bounds ⋮ A linear-time algorithm for finding an edge-partition with max-min ratio at most two ⋮ Minimum \(L_k\) path partitioning-an illustration of the Monge property ⋮ Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane ⋮ Fitting a Step Function to a Point Set ⋮ New algorithms for facility location problems on the real line ⋮ Approximations for the general block distribution of a matrix ⋮ Fitting a step function to a point set ⋮ Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches ⋮ On some geometric selection and optimization problems via sorted matrices ⋮ Algorithms for covering multiple barriers ⋮ Partitioning a graph into balanced connected classes: formulations, separation and experiments ⋮ Approximations for the general block distribution of a matrix ⋮ Linear-Time Fitting of a k-Step Function ⋮ Center location problems on tree graphs with subtree-shaped customers ⋮ Approximation algorithms for maximally balanced connected graph partition ⋮ Max-min dispersion on a line ⋮ Unnamed Item ⋮ On some geometric selection and optimization problems via sorted matrices ⋮ Scheduling with gaps: new models and algorithms ⋮ Continuous bottleneck tree partitioning problems ⋮ Approximation algorithms for the maximally balanced connected graph tripartition problem ⋮ An O(n log n)-Time Algorithm for the k-Center Problem in Trees ⋮ An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees
This page was built for publication:
