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 条
  • [31] TRANSPORTATION PROBLEMS IN NETWORKS WITH RESTRICTIONS
    FIEDLER, M
    EKONOMICKO-MATEMATICKY OBZOR, 1965, 65 (01): : 47 - 58
  • [32] A NOTE ON SOLVING THE BALANCING PROBLEM
    KESTER, GW
    FINANCIAL MANAGEMENT, 1987, 16 (01) : 52 - 54
  • [33] CONTROL PROBLEMS WITH FUNCTIONAL RESTRICTIONS
    WARGA, J
    SIAM JOURNAL ON CONTROL, 1970, 8 (03): : 360 - &
  • [34] Restrictions of minimum spanner problems
    Venkatesan, G
    Rotics, U
    Madanlal, MS
    Makowsky, JA
    Rangan, CP
    INFORMATION AND COMPUTATION, 1997, 136 (02) : 143 - 164
  • [35] Spectrum balancing for DSL with restrictions on maximum transmit PSD
    Statovci, Driton
    Nordstroem, Tomas
    Nilsson, Rickard
    2007 SECOND INTERNATIONAL CONFERENCE ON ACCESS NETWORKS & WORKSHOPS, 2007, : 46 - 50
  • [36] A Note on Graph Pebbling
    Andrzej Czygrinow
    Glenn Hurlbert
    H.A. Kierstead
    William T. Trotter
    Graphs and Combinatorics, 2002, 18 : 219 - 225
  • [37] NOTE ON TURANS GRAPH
    MARCU, D
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 1993, 43 (03) : 499 - 501
  • [38] A NOTE ON GRAPH DECIMATION
    ROSENFELD, A
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 532 : 637 - 640
  • [39] A note on graph pebbling
    Czygrinow, A
    Hurlbert, G
    Kierstead, HAI
    Trotter, WT
    GRAPHS AND COMBINATORICS, 2002, 18 (02) : 219 - 225
  • [40] A NOTE ON DIAMETER OF A GRAPH
    BONDY, JA
    CANADIAN MATHEMATICAL BULLETIN, 1968, 11 (03): : 499 - &
12345