Sciweavers

96 search results - page 6 / 20
» Approximating the maximum quadratic assignment problem
Sort
View
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
IPL
2006
84views more  IPL 2006»
13 years 8 months ago
On the hardness of approximating Max-Satisfy
Max-Satisfy is the problem of finding an assignment that satisfies the maximum number of equations in a system of linear equations over Q. We prove that unless NPBPP Max-Satisfy c...
Uriel Feige, Daniel Reichman
ICASSP
2011
IEEE
13 years 8 days ago
Maximum likelihood ICA of quaternion Gaussian vectors
This work considers the independent component analysis (ICA) of quaternion random vectors. In particular, we focus on the Gaussian case, and therefore the ICA problem is solved by...
Javier Vía, Daniel P. Palomar, Luis Vielva,...
CP
2006
Springer
14 years 8 days ago
Approximability of Integer Programming with Generalised Constraints
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subjec...
Peter Jonsson, Fredrik Kuivinen, Gustav Nordh
COMCOM
2004
78views more  COMCOM 2004»
13 years 8 months ago
Wavelength assignment to lightpaths for minimal wavelength conversions in multihop WDM networks
In multihop wavelength division multiplexing systems, a connection between two communication nodes consists of one or more lightpaths. A wavelength conversion is required at the j...
Xiaohua Jia, David Hongwei Du, Xiao-Dong Hu, Deyin...