Minimum dispersion problems
type: Item
instance of: scholarly article
title: Minimum dispersion problems
zbMATH Open document ID: 0883.90103
DOI: 10.1016/S0166-218X(96)00082-0
author: Abraham P. Punnen
author: Y. P. Aneja
published in: Discrete Applied Mathematics
publication date: 1998-03-04T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1047185
zbMATH Keywords: matching
zbMATH Keywords: dispersion criterion
zbMATH Keywords: \(\varepsilon\)-approximation scheme
MaRDI profile type: Publication
cites work: Q4773298
cites work: Minimax linear programming problem
cites work: The Sharing Problem
cites work: Most and least uniform spanning trees
cites work: A problem in vision that is polynomially solvable
cites work: A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms
cites work: Minimum deviation and balanced optimization: A unified approach
cites work: On finding most uniform spanning trees
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: Minimum deviation problems
cites work: Minimizing the Range of Lateness on a Single Machine
cites work: An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion
cites work: Efficient algorithms for minimum range cut problems
cites work: An Algorithm for Minimizing the Range of Lateness on a Single Machine
cites work: Balanced optimization problems
cites work: On \(k\)-sum optimization
cites work: Minimization of maximum absolute deviation in integers
cites work: Linear and combinatorial sharing problems
OpenAlex ID: W1995001486
description: scientific article; zbMATH DE number 1047185