This is a preview. Log in through your library . Abstract We exhibit natural classes of Polish topological groups G such that every continuous action of G on a compact space has a fixed point, and ...

We propose a new class of algorithms for linear cost network flow problems with and without gains. These algorithms are based on iterative improvement of a dual cost and operate in a manner that is ...

Computer scientists have written a network flow algorithm that computes almost as fast as is mathematically possible. This algorithm computes the maximum traffic flow with minimum transport costs for ...

Three weeks ago, January 2002 was the worst January in a decade in terms of equity fund flows. A few days later, January 2002 was a great, $20 billion month. Mutual fund data provider Lipper had ...

Current chemotherapeutic regimens achieve CR in a large percentage of patients with AML. However, relapse after CR remains a significant problem. The presence of leukemic cells at levels too low to be ...