A note on graph balancing problems with restrictions

被引：14
|
作者：
Lee, Kangbok [2 ]
Leung, Joseph Y. -T [1 ]
Pinedo, Michael L. [2 ]
机构：
[1] New Jersey Inst Technol, Dept Comp Sci, Newark, NJ 07102 USA
[2] NYU, Stern Sch Business, Dept Informat Operat & Management Sci, New York, NY 10012 USA
来源：
INFORMATION PROCESSING LETTERS | 2009年 / 110卷 / 01期
基金：
美国国家科学基金会;
关键词：
Approximation algorithm; Combinatorial problems; Computational complexity; Graph balancing; Parallel machines scheduling; Eligibility constraints; Fully polynomial time approximation scheme (FPTAS); PROCESSING SET RESTRICTIONS; APPROXIMATION ALGORITHMS; PARALLEL MACHINES; OUTDEGREE;
D O I：
10.1016/j.ipl.2009.09.015
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码：24 / 29
页数：6
相关论文
共 50 条
12345