A note on graph balancing problems with restrictions

Authors

Kangbok Lee, Leonard N. Stern School of Business
Joseph Y.T. Leung, Department of Computer Science
Michael L. Pinedo, Leonard N. Stern School of Business

Document Type

Article

Publication Date

12-1-2009

Abstract

We consider the graph balancing problem of providing orientations to edges in an undirected multi-graph to minimize the maximum load. We first obtain an FPTAS when the multi-graph is restricted to a tree. We also obtain some additional results for other restricted cases by showing equivalencies with related combinatorial problems. © 2009 Elsevier B.V. All rights reserved.

Identifier

70449526444 (Scopus)

Publication Title

Information Processing Letters

External Full Text Location

https://doi.org/10.1016/j.ipl.2009.09.015

ISSN

00200190

First Page

24

Last Page

29

Issue

1

Volume

110

Grant

KRF-2007-357-D00270

Fund Ref

National Science Foundation

Recommended Citation

Lee, Kangbok; Leung, Joseph Y.T.; and Pinedo, Michael L., "A note on graph balancing problems with restrictions" (2009). Faculty Publications. 11806.
https://digitalcommons.njit.edu/fac_pubs/11806