Sciweavers

96 search results - page 2 / 20
» Approximating the maximum quadratic assignment problem
Sort
View
MFCS
2005
Springer
13 years 10 months ago
Tight Approximability Results for the Maximum Solution Equation Problem over Zp
In the maximum solution equation problem a collection of equations are given over some algebraic structure. The objective is to find an assignment to the variables in the equation...
Fredrik Kuivinen
SIAMJO
2002
142views more  SIAMJO 2002»
13 years 4 months ago
A Complementary Pivoting Approach to the Maximum Weight Clique Problem
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
Alessio Massaro, Marcello Pelillo, Immanuel M. Bom...
IPL
2008
111views more  IPL 2008»
13 years 5 months ago
Adding cardinality constraints to integer programs with applications to maximum satisfiability
Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of ...
Markus Bläser, Thomas Heynen, Bodo Manthey
SSPR
2000
Springer
13 years 8 months ago
A New Approximation Method of the Quadratic Discriminant Function
Abstract. For many statistical pattern recognition methods, distributions of sample vectors are assumed to be normal, and the quadratic discriminant function derived from the proba...
Shinichiro Omachi, Fang Sun, Hirotomo Aso
ADHOCNOW
2004
Springer
13 years 10 months ago
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
Errol L. Lloyd, Rui Liu, S. S. Ravi