scientific article; zbMATH DE number 432817
From MaRDI portal
Publication:3138951
zbMATH Open0800.68636MaRDI QIDQ3138951FDOQ3138951
Authors: Greg N. Frederickson 
Publication date: 20 October 1993
Title of this publication is not available (Why is that?)
Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10)
Cited In (38)
- An overview of graph covering and partitioning
- Improved algorithms for path partition and related problems
- Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches
- Fitting a step function to a point set
- Approximating points by a piecewise linear function
- Minimum \(L_k\) path partitioning-an illustration of the Monge property
- Bounded fan-out \(m\)-center problem
- Faster distance-based representative skyline and \(k\)-center along Pareto front in the plane
- Center location problems on tree graphs with subtree-shaped customers
- Continuous bottleneck tree partitioning problems
- Improvements on geometric pattern matching problems
- Dispersion problem on a convex polygon
- Getting around a lower bound for the minimum Hausdorff distance
- Partitioning a graph into balanced connected classes: formulations, separation and experiments
- Approximations for the general block distribution of a matrix
- A tight bound on the min-ratio edge-partitioning problem of a tree
- Linear-time fitting of a \(k\)-step function
- Linear-time fitting of a \(k\)-step function
- On some geometric selection and optimization problems via sorted matrices
- Computing \(k\)-centers of uncertain points on a real line
- Fitting a Step Function to a Point Set
- Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane
- An \(O(n\log n)\)-time algorithm for the \(k\)-center problem in trees
- Two new algorithms for the min-power broadcast problem in static ad hoc networks
- Max-min dispersion on a line
- Approximations for the general block distribution of a matrix
- Scheduling with gaps: new models and algorithms
- A linear-time algorithm for finding an edge-partition with max-min ratio at most two
- Approximation algorithms for maximally balanced connected graph partition
- Dispersion on trees
- An \(O(n\log n)\)-time algorithm for the \(k\)-center problem in trees
- Approximation algorithms for the maximally balanced connected graph tripartition problem
- Approximation and parameterized algorithms for balanced connected partition problems
- Approximation algorithms for the maximum bounded connected bipartition problem
- On some geometric selection and optimization problems via sorted matrices
- Balanced connected partitions of graphs: approximation, parameterization and lower bounds
- Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications
- New algorithms for facility location problems on the real line
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138951)
