k-Center Problems with Minimum Coverage
The k-center problem is a well-known facility location problem and can be described as follows: Given a complete undirected graph G=(V,E), a metric d:V×V→ℝ + and a positive integer k, we seek a subset U ⊆ V of at most k centers which minimizes the maximum distances from points in V to U. Formally,...
Saved in:
Main Authors: | LIM, Andrew, RODRIGUES, Brian, WANG, Fan, XU, Zhou |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2004
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/lkcsb_research/2400 https://doi.org/10.1007/978-3-540-27798-9_38 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
k-Center Problems with Minimum Coverage
by: LIM, Andrew, et al.
Published: (2005) -
k-Center problems with minimum coverage
by: Rodrigues, Brian, et al.
Published: (2004) -
Solving a Crane Scheduling Problem Using Intelligent Search Schemes
by: LIM, Andrew, et al.
Published: (2004) -
A New Heuristic Method for the Bandwidth Minimization Problem
by: LIM, Andrew, et al.
Published: (2003) -
A Centroid-Based Approach to Solve the Bandwidth Minimization Problem
by: LIM, Andrew, et al.
Published: (2004)