Sciweavers

415 search results - page 7 / 83
» An efficient approximation for the Generalized Assignment Pr...
Sort
View
CSR
2007
Springer
14 years 2 months ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
COR
2006
113views more  COR 2006»
13 years 8 months ago
Capacitated facility location problem with general setup cost
This paper presents an extension of the capacitated facility location problem (CFLP), in which the general setup cost functions and multiple facilities in one site are considered....
Ling-Yun Wu, Xiang-Sun Zhang, Ju-Liang Zhang
GLOBECOM
2006
IEEE
14 years 2 months ago
Optimization on Hybrid Channel Assignment for Multi-channel Multi-radio Wireless Mesh Networks
The emergence of multi-channel multi-radio wireless mesh networks has given us many new opportunities and challenges. Particularly, the issue on how to appropriately assign channel...
Andy An-Kai Jeng, Rong-Hong Jan
SWAT
2004
Springer
156views Algorithms» more  SWAT 2004»
14 years 1 months ago
The Bottleneck Problem with Minimum Quantity Commitments
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introdu...
Andrew Lim, Zhou Xu
MONET
2006
107views more  MONET 2006»
13 years 8 months ago
Utilization and fairness in spectrum assignment for opportunistic spectrum access
The Open Spectrum approach to spectrum access can achieve near-optimal utilization by allowing devices to sense and utilize available spectrum opportunistically. However, a naive d...
Chunyi Peng, Haitao Zheng, Ben Y. Zhao