DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hasan, Mohammad Khairul | ko |
dc.contributor.author | Jung, Hyunwoo | ko |
dc.contributor.author | Chwa, Kyung Yong | ko |
dc.date.accessioned | 2013-03-06T18:20:55Z | - |
dc.date.available | 2013-03-06T18:20:55Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2008-08 | - |
dc.identifier.citation | JOURNAL OF COMBINATORIAL OPTIMIZATION, v.16, no.2, pp.155 - 172 | - |
dc.identifier.issn | 1382-6905 | - |
dc.identifier.uri | http://hdl.handle.net/10203/87928 | - |
dc.description.abstract | We study Connected Facility Location problems. We are given a connected graph G = (V, E) with nonnegative edge cost c(e) for each edge e epsilon E, a set of clients D subset of V such that each client j epsilon D has positive demand d(j) and a set of facilities F subset of V each has nonnegative opening cost f(i) and capacity to serve all client demands. The objective is to open a subset of facilities, say (F) over cap, to assign each client j epsilon D to exactly one open facility i(j) and to connect all open facilities by a Steiner tree T such that the cost Sigma(i epsilon(F) over cap) f(i) + Sigma (j epsilon D) d(j)c(i(j)j) + M Sigma(e epsilon T) c(e) is minimized for a given input parameter M >= 1. We propose a LP-rounding based 8.29 approximation algorithm which improves the previous bound 8.55 (Swamy and Kumar in Algorithmica, 40: 245-269, 2004). We also consider the problem when opening cost of all facilities are equal. In this case we give a 7.0 approximation algorithm. | - |
dc.language | English | - |
dc.publisher | SPRINGER | - |
dc.subject | PRIMAL-DUAL ALGORITHMS | - |
dc.title | Approximation algorithms for connected facility location problems | - |
dc.type | Article | - |
dc.identifier.wosid | 000256777800006 | - |
dc.identifier.scopusid | 2-s2.0-45849105611 | - |
dc.type.rims | ART | - |
dc.citation.volume | 16 | - |
dc.citation.issue | 2 | - |
dc.citation.beginningpage | 155 | - |
dc.citation.endingpage | 172 | - |
dc.citation.publicationname | JOURNAL OF COMBINATORIAL OPTIMIZATION | - |
dc.identifier.doi | 10.1007/s10878-007-9130-0 | - |
dc.contributor.localauthor | Chwa, Kyung Yong | - |
dc.type.journalArticle | Article; Proceedings Paper | - |
dc.subject.keywordAuthor | approximation algorithms | - |
dc.subject.keywordAuthor | integer programming | - |
dc.subject.keywordAuthor | LP-rounding | - |
dc.subject.keywordAuthor | connected facility location | - |
dc.subject.keywordAuthor | Steiner tree | - |
dc.subject.keywordPlus | PRIMAL-DUAL ALGORITHMS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.