Background: There are a number of different implant choices for surgical treatment of distal radius fractures, oftendetermined by surgeon preference or availability. Although no one volar plate demonstrates superior outcomes, thereare significant cost differences absorbed by hospitals and surgical centers. This purpose of this study is to characterizethe economic implications of implant selecti...

We consider the universal facility location problem in which the goal is to assign clients to facilities in order to minimize the sum of connection and facility costs. The connection cost is proportional to the distance each client has to travel to its assigned facility, whereas the cost of a facility is a non-decreasing function depending on the number of clients assigned to the facility. This...

With ever growing use of Internet for electronic commerce and data mining type applications there seems to be a need for new network computing paradigms that can overcome the barriers posed by network congestion and unreliability. Mobile agent programming is a paradigm that enables the programs to move from one host to another, do the processing locally and return results asynchronously. In thi...

In this paper we study the facility leasing problem with penalties. We present a primaldual algorithm which is a 3-approximation, based on the algorithm by Nagarajan and Williamson for the facility leasing problem [NW13] and on the algorithm by Charikar et al. for the facility location problem with penalties [CKMN01].

The G-Lab project aims to investigate concepts and technologies for future networks in a practical manner. Thus G-Lab consists of two major fields of activities: research studies of future network components and the design and setup of experimental facilities. Both is controlled by the same community to ensure, that the experimental facility fits to the demand of researchers. Researchers gain a...

We study leasing variants of the connected facility location problem, in which we wish to connect a set of clients to facilities, and facilities are connected via core edges, whose cost is a scale factor times the cost of a simple edge. We identify two aspects of the problem that can lead to different variants: (a) if there is a single or multiple commodities, and (b) if we lease facilities and...

The recent results from Super-K clearly indicate the existence of neutrino oscillations and, therefore, motivate the building of a muon storage ring (20-50 GeV) that can produce a directed beam of intense neutrinos (10 -10 per year) for both domestic and intercontinental experiments (base line of as much as 5,000 km). Such a device requires a powerful proton source (1-4 MW), muon capture, manip...

Facility location games have been a topic of major interest in economics, operations research and computer science, starting from the seminal work by Hotelling. Spatial facility location models have successfully predicted the outcome of competition in a variety of scenarios. In a typical facility location game, users/customers/voters are mapped to a metric space representing their preferences, ...

In out last lecture, we discussed the LP Rounding technique for producing approximation algorithms. The idea behind LP Rounding is to write the problem as an integer linear program, relax its integrality restraints to efficiently solve the general linear program, and then move the LP solution to a nearby integral point in the feasible solution space. The difficulty of this process lies in the r...