SCOPUS 정보 검색 플랫폼

Volumn 54, Issue 3, 2009, Pages 318-336

Minimum-Cost Load-Balancing Partitions

(3) Aronov, Boris a Carmi, Paz b Katz, Matthew J b

a POLYTECHNIC UNIVERSITY (United States)

b BEN GURION UNIVERSITY OF THE NEGEV (Israel)

Author keywords

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

Indexed keywords

AVERAGE DISTANCES; CONSTANT FACTORS; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; CONVEX POLYGONS; FAT PARTITIONS; FATNESS; FOLLOWING PROBLEMS; GEOMETRIC OPTIMIZATION; INTERMEDIATE RESULTS; LOAD BALANCING; LOAD BALANCING PROBLEMS; OPTIMAL PARTITIONS; TOTAL COSTS;

GEOMETRY; OPTIMIZATION; PARTITIONS (BUILDING);

APPROXIMATION ALGORITHMS;

EID: 67349206754 PISSN: 01784617 EISSN: 14320541 Source Type: Journal
DOI: 10.1007/s00453-007-9125-3 Document Type: Article

Times cited : (23)

References (11)

1
- 33748051075
- Minimum-cost load-balancing partitions
- Aronov, B., Carmi, P., Katz, M.J.: Minimum-cost load-balancing partitions. In: Proc. 22nd ACM Symp. on Computational Geometry, pp. 301-308, 2006
- (2006) Proc. 22nd ACM Symp. on Computational Geometry , pp. 301-308
- Aronov, B.¹ Carmi, P.² Katz, M.J.³

2
- 0032266683
- Efficient algorithms for geometric optimization
- P.K. Agarwal M. Sharir 1998 Efficient algorithms for geometric optimization ACM Comput. Surv. 30 4 412 458
- (1998) ACM Comput. Surv. , vol.30 , Issue.4 , pp. 412-458
- Agarwal, P.K.¹ Sharir, M.²

3
- 0033296344
- Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
- P.K. Agarwal A. Efrat M. Sharir 1999 Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications SIAM J. Comput. 29 3 912 953
- (1999) SIAM J. Comput. , vol.29 , Issue.3 , pp. 912-953
- Agarwal, P.K.¹ Efrat, A.² Sharir, M.³

4
- 3843098445
- Minkowski-type theorems and least-squares clustering
- F. Aurenhammer F. Hoffmann B. Aronov 1998 Minkowski-type theorems and least-squares clustering Algorithmica 20 1 61 76 (Pubitemid 128663377)
- (1998) Algorithmica (New York) , vol.20 , Issue.1 , pp. 61-76
- Aurenhammer, F.¹ Hoffmann, F.² Aronov, B.³

5
- 0141888135
- Realistic input models for geometric algorithms
- M. de Berg M.J. Katz A.F. van der Stappen J. Vleugels 2002 Realistic input models for geometric algorithms Algorithmica 34 1 81 97
- (2002) Algorithmica , vol.34 , Issue.1 , pp. 81-97
- De Berg, M.¹ Katz, M.J.² Van Der Stappen, A.F.³ Vleugels, J.⁴

6
- 13644254145
- Geographic quorum system approximations
- P. Carmi S. Dolev S. Har-Peled M.J. Katz M. Segal 2005 Geographic quorum system approximations Algorithmica 41 4 233 244
- (2005) Algorithmica , vol.41 , Issue.4 , pp. 233-244
- Carmi, P.¹ Dolev, S.² Har-Peled, S.³ Katz, M.J.⁴ Segal, M.⁵

7
- 84867949402
- On the Fermat-Weber center of a convex object
- P. Carmi S. Har-Peled M.J. Katz 2005 On the Fermat-Weber center of a convex object Comput. Geom. Theory Appl. 32 3 188 195
- (2005) Comput. Geom. Theory Appl. , vol.32 , Issue.3 , pp. 188-195
- Carmi, P.¹ Har-Peled, S.² Katz, M.J.³

8
- 20744435601
- Approximating k-median with non-uniform capacities
- Chuzhoy, J., Rabani, Y.: Approximating k-median with non-uniform capacities, In: Proc. 16th ACM-SIAM Symp. Discrete Algorithms, pp. 952-958, 2005
- (2005) Proc. 16th ACM-SIAM Symp. Discrete Algorithms , pp. 952-958
- Chuzhoy, J.¹ Rabani, Y.²

9
- 14644410380
- On the continuous Fermat-Weber problem
- S.P. Fekete J.S.B. Mitchell K. Beurer 2005 On the continuous Fermat-Weber problem Oper. Res. 53 1 61 76
- (2005) Oper. Res. , vol.53 , Issue.1 , pp. 61-76
- Fekete, S.P.¹ Mitchell, J.S.B.² Beurer, K.³

10
- 0002719797
- The Hungarian method for the assignment problem
- H.W. Kuhn 1955 The Hungarian method for the assignment problem Nav. Res. Logist. Q. 2 83 97
- (1955) Nav. Res. Logist. Q. , vol.2 , pp. 83-97
- Kuhn, H.W.¹

11
- 0003736078
- 2 Prentice Hall New York
- West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, New York (2001)
- (2001) Introduction to Graph Theory
- West, D.B.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.