User allocation in multi-system, multi-service scenarios: Upper and lower performance bound of polynomial time assignment algorithms

Forty-first Annual Conference on Information Sciences and Systems, CISS 2007 - Proceedings

Volumn , Issue , 2007, Pages 41-46

  Blau, Ingmar ^a   Wunder, Gerhard ^a  

^a FRAUNHOFER HEINRICH HERTZ INSTITUTE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL TIME ASSIGNMENT ALGORITHMS; RADIO ACCESS TECHNOLOGIES (RAT);

CONSTRAINED OPTIMIZATION; LAGRANGE MULTIPLIERS; POLYNOMIALS; RADIO SYSTEMS;

PROBLEM SOLVING;

EID: 44049103726     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CISS.2007.4298270     Document Type: Conference Paper

References (6)

1. Anders Furuskär and Jens Zander, "Multiservice Allocation for Multiaccess Wireless Systems," IEEE Transactions on Wireless Communications, vol. 4, no. 1, January 2005.
2. L. Fleischer, M.X. Goemans, V.S. Mirrokni, and M. Sviridenko, "Tight Approximation Algorithms for Maximum, General Assignment Problems" in Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms, 2006.
3. Joakim Jalden Cristoff Martin, and Björn Ottersteri, "Semidefinte Programming for Detection in Linear Systems - Optimality Conditions and Space-Time Decoding,": in Acoustics Speech, and Signal Processing, 2003.
4. Stephen Boyd and Lieven Vandenberghe, Convex Optimization, Cambridge University Press, 2004.
5. R. M Freund and C. Roos, "The ellipsoid method," www.isa.ewi.tudelft.nl/~rods/courses/wi485/ellips.pdf.
6. Hans Kellerer, Ulrich Pferschy and David Pisinger, Knapsack Problems, Springer, Berlin, Germany, 2004.