Advanced

Balanced Partition of Minimum Spanning Trees

Andersson, Mattias LU ; Gudmundsson, Joachim; Levcopoulos, Christos LU and Narasimhan, Giri (2002) International Conference on Computational Science In Computational Science — ICCS 2002 / Lecture notes in computer science 2331. p.26-35
Abstract
To better handle situations where additional resources are available to carry out a task, many problems from the manufacturing industry involve "optimally" dividing a task into k smaller tasks. We consider the problem of partitioning a given set S of n points (in the plane) into k subsets, S1,...,Sk that max 1leqslant i leqslant k |MST(Si) | is minimized. A variant of this problem arises in the shipbuilding industry [2].
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
in
Computational Science — ICCS 2002 / Lecture notes in computer science
volume
2331
pages
26 - 35
publisher
Springer
conference name
International Conference on Computational Science
external identifiers
  • wos:000181351200003
  • scopus:84886813983
ISSN
0302-9743
1611-3349
DOI
10.1007/3-540-47789-6_3
language
English
LU publication?
yes
id
346d2d01-22a3-4433-b12a-011e0c984fd7 (old id 633243)
date added to LUP
2007-11-28 14:30:12
date last changed
2017-03-19 03:28:21
@inproceedings{346d2d01-22a3-4433-b12a-011e0c984fd7,
  abstract     = {To better handle situations where additional resources are available to carry out a task, many problems from the manufacturing industry involve "optimally" dividing a task into k smaller tasks. We consider the problem of partitioning a given set S of n points (in the plane) into k subsets, S1,...,Sk that max 1leqslant i leqslant k |MST(Si) | is minimized. A variant of this problem arises in the shipbuilding industry [2].},
  author       = {Andersson, Mattias and Gudmundsson, Joachim and Levcopoulos, Christos and Narasimhan, Giri},
  booktitle    = {Computational Science — ICCS 2002 / Lecture notes in computer science},
  issn         = {0302-9743},
  language     = {eng},
  pages        = {26--35},
  publisher    = {Springer},
  title        = {Balanced Partition of Minimum Spanning Trees},
  url          = {http://dx.doi.org/10.1007/3-540-47789-6_3},
  volume       = {2331},
  year         = {2002},
}