Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 8 of 8 for “"k-center"”.
-
Approximation algorithms for clustering and facility location problems
… Facility Location (USFL), and Capacitated k-center (CapKCenter) problems. USFL is a generalization of the well-known Uncapacitated Facility Location problem. In USFL the cost of opening a facility is a submodular function of the clients assigned to it (the function is identical for all …
-
Geometric Algorithms for Objects in Motion
… approximation algorithm for the kinetic robust k-center problem, a clustering problem that requires k clusters but allows some outlying points to remain unclustered. For many practical problems that inspired the exploration into robustness, the KDS model is inapplicable due to the point motion …
-
The effect of stress on the luminescence spectrum of irradiated silicon
… identification of these bands with the K-center or G-15 center seen in EPR. A model for this defect which was tentatively suggested by the EPR investigators consists of two nearest neighbor substitutional oxygen atoms in a [221] crystal orientation. The stress data are not completely …
-
In pursuit of linear complexity in discrete and computational geometry
… this framework, including finding the optimal k-center clustering, the kth ranked distance, the kth heaviest edge of the MST, the minimum radius ball enclosing k points, and many others. In several cases we get the first known linear time approximation algorithm for a given problem, where our …
-
Foundations of fuzzy answer set programming
… illustrate this on a continuous version of the k-center problem. Such a translation is important because it allows us to solve FASP programs by means of solvers for fuzzy SAT. Under the appropriate conditions it is for example possible to solve FASP programs by means of off-the-shelf solvers for …
-
Adaptive communication networks for heterogeneous teams of robots
… called the connected reachable k-connected center problem that extends the classical k-center problem. We propose an algorithm to compute a small representative set of clients where this set is of size (klog(n)/[epsilon])O (1), can be constructed in O(nk) time and updated in …
-
Abstraction and application: complementary perspectives on sociotechnical systems
… classical metric clustering problems such as k-center and facility location, which often underpin machine learning and resource allocation algorithms where real-world concerns such as fairness have become especially relevant. The first two chapters develop constant-factor approximation …
-
Commercial real estate operating expenses : an analysis of office operating expenses using NCREIF property level data
How do the various categories of operating expenses for institutional grade office buildings vary with changes in rental income and occupancy? The general consensus held is that, following the linear relationship that exists between variable expenses, occupancy and income; a change in either …