Sciweavers

84 search results - page 8 / 17
» Approximation Algorithms for the Sex-Equal Stable Marriage P...
Sort
View
WAOA
2005
Springer
161views Algorithms» more  WAOA 2005»
14 years 28 days ago
"Almost Stable" Matchings in the Roommates Problem
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
David J. Abraham, Péter Biró, David ...
JDA
2008
101views more  JDA 2008»
13 years 7 months ago
Student-Project Allocation with preferences over Projects
We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this...
David Manlove, Gregg O'Malley
ICASSP
2011
IEEE
12 years 11 months ago
Convex approximation algorithms for back-pressure power control of wireless multi-hop networks
Cross-layer design and operation of wireless networks has attracted significant interest in the last decade, yet some basic problems in the area remain unsolved. In this paper, w...
Evaggelia Matskani, Nikos D. Sidiropoulos, Leandro...
SIAMSC
2011
153views more  SIAMSC 2011»
13 years 2 months ago
Stable Computations with Gaussian Radial Basis Functions
Abstract. Radial basis function (RBF) approximation is an extremely powerful tool for representing smooth functions in non-trivial geometries, since the method is meshfree and can ...
Bengt Fornberg, Elisabeth Larsson, Natasha Flyer
INFOCOM
2011
IEEE
12 years 11 months ago
Approximation algorithms for throughput maximization in wireless networks with delay constraints
—We study the problem of throughput maximization in multi-hop wireless networks with end-to-end delay constraints for each session. This problem has received much attention start...
Guanhong Pei, V. S. Anil Kumar, Srinivasan Parthas...