Article
Cited 13 time in 
Cited 14 time in 
Cited 14 time in
Metadata Downloads
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Lee, K | - |
| dc.contributor.author | Leung, JYT | - |
| dc.contributor.author | Pinedo, ML | - |
| dc.date.accessioned | 2017-07-19T12:45:21Z | - |
| dc.date.available | 2017-07-19T12:45:21Z | - |
| dc.date.created | 2016-07-12 | - |
| dc.date.issued | 2009-12-01 | - |
| dc.identifier.issn | 0020-0190 | - |
| dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/36386 | - |
| dc.description.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. (C) 2009 Elsevier B.V. All rights reserved. | - |
| dc.language | English | - |
| dc.publisher | ELSEVIER SCIENCE BV | - |
| dc.relation.isPartOf | INFORMATION PROCESSING LETTERS | - |
| dc.title | A Note on Graph Balancing Problems with Restrictions | - |
| dc.type | Article | - |
| dc.identifier.doi | 10.1016/J.IPL.2009.09.015 | - |
| dc.type.rims | ART | - |
| dc.identifier.bibliographicCitation | INFORMATION PROCESSING LETTERS, v.110, no.1, pp.24 - 29 | - |
| dc.identifier.wosid | 000272583400006 | - |
| dc.date.tcdate | 2019-02-01 | - |
| dc.citation.endPage | 29 | - |
| dc.citation.number | 1 | - |
| dc.citation.startPage | 24 | - |
| dc.citation.title | INFORMATION PROCESSING LETTERS | - |
| dc.citation.volume | 110 | - |
| dc.contributor.affiliatedAuthor | Lee, K | - |
| dc.identifier.scopusid | 2-s2.0-70449526444 | - |
| dc.description.journalClass | 1 | - |
| dc.description.journalClass | 1 | - |
| dc.description.wostc | 8 | - |
| dc.description.scptc | 7 | * |
| dc.date.scptcdate | 2018-05-121 | * |
| dc.type.docType | Article | - |
| dc.subject.keywordPlus | PROCESSING SET RESTRICTIONS | - |
| dc.subject.keywordPlus | APPROXIMATION ALGORITHMS | - |
| dc.subject.keywordPlus | PARALLEL MACHINES | - |
| dc.subject.keywordPlus | OUTDEGREE | - |
| dc.subject.keywordAuthor | Approximation algorithm | - |
| dc.subject.keywordAuthor | Combinatorial problems | - |
| dc.subject.keywordAuthor | Computational complexity | - |
| dc.subject.keywordAuthor | Graph balancing | - |
| dc.subject.keywordAuthor | Parallel machines scheduling | - |
| dc.subject.keywordAuthor | Eligibility constraints | - |
| dc.subject.keywordAuthor | Fully polynomial time approximation scheme (FPTAS) | - |
| dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
| dc.description.journalRegisteredClass | scie | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.relation.journalResearchArea | Computer Science | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
Communities & Collection
Related Researcher
- 이강복LEE, KANGBOK
- Dept. of Industrial & Management Eng.