Minimum-Cost Load-Balancing Partitions

Boris Aronov, Paz Carmi, Matthew J. Katz

    Research output: Contribution to journalArticle

    Abstract

    We consider the problem of balancing the load among several service-providing facilities, while keeping the total cost low. Let D be the underlying demand region, and let p 1,p m be m points representing m facilities. We consider the following problem: Subdivide D into m equal-area regions R 1,R m , so that region R i is served by facility p i , and the average distance between a point q in D and the facility that serves q is minimal. We present constant-factor approximation algorithms for this problem, with the additional requirement that the resulting regions must be convex. As an intermediate result we show how to partition a convex polygon into m equal-area convex subregions so that the fatness of the resulting regions is within a constant factor of the fatness of the original polygon. In fact, we prove that our partition is, up to a constant factor, the best one can get if one's goal is to maximize the fatness of the least fat subregion. We also discuss the structure of the optimal partition for the aforementioned load balancing problem: indeed, we argue that it is always induced by an additive-weighted Voronoi diagram for an appropriate choice of weights.

    Original languageEnglish (US)
    Pages (from-to)318-336
    Number of pages19
    JournalAlgorithmica (New York)
    Volume54
    Issue number3
    DOIs
    StatePublished - Jul 2009

    Fingerprint

    Load Balancing
    Resource allocation
    Partition
    Costs
    Approximation algorithms
    Optimal Partition
    Subdivide
    Oils and fats
    Average Distance
    Convex polygon
    Voronoi Diagram
    Balancing
    Polygon
    Approximation Algorithms
    Maximise
    Requirements

    Keywords

    • Additive-weighted Voronoi diagram
    • Approximation algorithms
    • Fat partitions
    • Fatness
    • Geometric optimization
    • Load balancing

    ASJC Scopus subject areas

    • Computer Science(all)
    • Computer Science Applications
    • Applied Mathematics

    Cite this

    Minimum-Cost Load-Balancing Partitions. / Aronov, Boris; Carmi, Paz; Katz, Matthew J.

    In: Algorithmica (New York), Vol. 54, No. 3, 07.2009, p. 318-336.

    Research output: Contribution to journalArticle

    Aronov, B, Carmi, P & Katz, MJ 2009, 'Minimum-Cost Load-Balancing Partitions', Algorithmica (New York), vol. 54, no. 3, pp. 318-336. https://doi.org/10.1007/s00453-007-9125-3
    Aronov, Boris ; Carmi, Paz ; Katz, Matthew J. / Minimum-Cost Load-Balancing Partitions. In: Algorithmica (New York). 2009 ; Vol. 54, No. 3. pp. 318-336.
    @article{d7aeb711010b4283a3fd396a3db168e6,
    title = "Minimum-Cost Load-Balancing Partitions",
    abstract = "We consider the problem of balancing the load among several service-providing facilities, while keeping the total cost low. Let D be the underlying demand region, and let p 1,p m be m points representing m facilities. We consider the following problem: Subdivide D into m equal-area regions R 1,R m , so that region R i is served by facility p i , and the average distance between a point q in D and the facility that serves q is minimal. We present constant-factor approximation algorithms for this problem, with the additional requirement that the resulting regions must be convex. As an intermediate result we show how to partition a convex polygon into m equal-area convex subregions so that the fatness of the resulting regions is within a constant factor of the fatness of the original polygon. In fact, we prove that our partition is, up to a constant factor, the best one can get if one's goal is to maximize the fatness of the least fat subregion. We also discuss the structure of the optimal partition for the aforementioned load balancing problem: indeed, we argue that it is always induced by an additive-weighted Voronoi diagram for an appropriate choice of weights.",
    keywords = "Additive-weighted Voronoi diagram, Approximation algorithms, Fat partitions, Fatness, Geometric optimization, Load balancing",
    author = "Boris Aronov and Paz Carmi and Katz, {Matthew J.}",
    year = "2009",
    month = "7",
    doi = "10.1007/s00453-007-9125-3",
    language = "English (US)",
    volume = "54",
    pages = "318--336",
    journal = "Algorithmica",
    issn = "0178-4617",
    publisher = "Springer New York",
    number = "3",

    }

    TY - JOUR

    T1 - Minimum-Cost Load-Balancing Partitions

    AU - Aronov, Boris

    AU - Carmi, Paz

    AU - Katz, Matthew J.

    PY - 2009/7

    Y1 - 2009/7

    N2 - We consider the problem of balancing the load among several service-providing facilities, while keeping the total cost low. Let D be the underlying demand region, and let p 1,p m be m points representing m facilities. We consider the following problem: Subdivide D into m equal-area regions R 1,R m , so that region R i is served by facility p i , and the average distance between a point q in D and the facility that serves q is minimal. We present constant-factor approximation algorithms for this problem, with the additional requirement that the resulting regions must be convex. As an intermediate result we show how to partition a convex polygon into m equal-area convex subregions so that the fatness of the resulting regions is within a constant factor of the fatness of the original polygon. In fact, we prove that our partition is, up to a constant factor, the best one can get if one's goal is to maximize the fatness of the least fat subregion. We also discuss the structure of the optimal partition for the aforementioned load balancing problem: indeed, we argue that it is always induced by an additive-weighted Voronoi diagram for an appropriate choice of weights.

    AB - We consider the problem of balancing the load among several service-providing facilities, while keeping the total cost low. Let D be the underlying demand region, and let p 1,p m be m points representing m facilities. We consider the following problem: Subdivide D into m equal-area regions R 1,R m , so that region R i is served by facility p i , and the average distance between a point q in D and the facility that serves q is minimal. We present constant-factor approximation algorithms for this problem, with the additional requirement that the resulting regions must be convex. As an intermediate result we show how to partition a convex polygon into m equal-area convex subregions so that the fatness of the resulting regions is within a constant factor of the fatness of the original polygon. In fact, we prove that our partition is, up to a constant factor, the best one can get if one's goal is to maximize the fatness of the least fat subregion. We also discuss the structure of the optimal partition for the aforementioned load balancing problem: indeed, we argue that it is always induced by an additive-weighted Voronoi diagram for an appropriate choice of weights.

    KW - Additive-weighted Voronoi diagram

    KW - Approximation algorithms

    KW - Fat partitions

    KW - Fatness

    KW - Geometric optimization

    KW - Load balancing

    UR - http://www.scopus.com/inward/record.url?scp=67349206754&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=67349206754&partnerID=8YFLogxK

    U2 - 10.1007/s00453-007-9125-3

    DO - 10.1007/s00453-007-9125-3

    M3 - Article

    VL - 54

    SP - 318

    EP - 336

    JO - Algorithmica

    JF - Algorithmica

    SN - 0178-4617

    IS - 3

    ER -