The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Balanced Partition of Minimum Spanning Trees

På svenska

Author

Summary, in English

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].

Department/s

  • Computer Science

Publishing year

2002

Language

English

Pages

26-35

Publication/Series

Computational Science — ICCS 2002 / Lecture notes in computer science

Volume

2331

Document type

Conference paper

Publisher

Springer

Topic

  • Computer Science

Conference name

International Conference on Computational Science

Conference date

2002-04-21 - 2002-04-24

Conference place

Netherlands

Status

Published

ISBN/ISSN/Other

  • ISSN: 0302-9743
  • ISSN: 1611-3349