Sciweavers

284 search results - page 32 / 57
» Facility Location
Sort
View
MFCS
2001
Springer
14 years 2 days ago
The k-Median Problem for Directed Trees
Abstract Marek Chrobak1 , Lawrence L. Larmore2 , and Wojciech Rytter3,4 1 Department of Computer Science, University of California Riverside, CA 92521 2 Department of Computer Scie...
Marek Chrobak, Lawrence L. Larmore, Wojciech Rytte...
WSC
2000
13 years 9 months ago
Simulation of the remote unit assembly and test: a case study
This paper will present a case study on the use of simulation to develop and implement an assembly line for the assembly and test of customer located telephony equipment. The simu...
Jeff Fields, Dennis Davis, Alfred Taylor
POPL
1993
ACM
13 years 11 months ago
Quasi-Static Scoping: Sharing Variable Bindings Across Multiple Lexical Scopes
Static scoping embodies a strong encapsulation mechanism for hiding the details of program units. Yet, it does not allow the sharing of variable bindings locations across indepe...
Shinn-Der Lee, Daniel P. Friedman
SPAA
2010
ACM
14 years 13 days ago
Parallel approximation algorithms for facility-location problems
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
Guy E. Blelloch, Kanat Tangwongsan
TALG
2008
93views more  TALG 2008»
13 years 7 months ago
Limitations of cross-monotonic cost-sharing schemes
A cost-sharing scheme is a set of rules defining how to share the cost of a service (often computed by solving a combinatorial optimization problem) amongst serviced customers. A ...
Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirro...