SHIFTING ALGORITHM FOR A CONSTRAINED MIN-MAX PROBLEM ON TREES.

Eliezer Agasi, Ronald L. Becker, Yohoshua Perl

Research output: Contribution to conferencePaperpeer-review

4 Scopus citations

Abstract

This study is motivated by the following problem: Given data situated at the vertices of a tree, to efficiently partition it into pages. In a recent paper a criterion was proposed as follows: Perform the partition so that the largest page is as small as possible. However, it would be desirable to allow further criteria to be taken into account in the partitioning. We give two examples.

Original languageEnglish (US)
Pages253-256
Number of pages4
StatePublished - Dec 1 1982
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this