Sciweavers

96 search results - page 9 / 20
» Approximating the maximum quadratic assignment problem
Sort
View
ICC
2007
IEEE
176views Communications» more  ICC 2007»
14 years 2 months ago
An Interference-Aware Channel Assignment Scheme for Wireless Mesh Networks
—Multichannel communication in a Wireless Mesh Network with routers having multiple radio interfaces significantly enhances the network capacity. Efficient channel assignment an...
Arunabha Sen, Sudheendra Murthy, Samrat Ganguly, S...
FOCS
2008
IEEE
13 years 9 months ago
Minimizing Movement in Mobile Facility Location Problems
In the mobile facility location problem, which is a variant of the classical Uncapacitated Facility Location and kMedian problems, each facility and client is assigned to a start ...
Zachary Friggstad, Mohammad R. Salavatipour
IFIP
2005
Springer
14 years 2 months ago
A New Low Rank Quasi-Newton Update Scheme for Nonlinear Programming
A new quasi-Newton scheme for updating a low rank positive semi-definite Hessian approximation is described, primarily for use in sequential quadratic programming methods for non...
R. Fletcher
FSTTCS
2009
Springer
14 years 3 months ago
Donation Center Location Problem
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
Chien-Chung Huang, Zoya Svitkina
ALGORITHMICA
1999
102views more  ALGORITHMICA 1999»
13 years 8 months ago
Approximating Latin Square Extensions
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
Ravi Kumar, Alexander Russell, Ravi Sundaram