Sciweavers

2714 search results - page 180 / 543
» Approximation Schemes for Scheduling
Sort
View
STOC
2005
ACM
142views Algorithms» more  STOC 2005»
16 years 4 months ago
Market equilibrium via the excess demand function
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...
Bruno Codenotti, Benton McCune, Kasturi R. Varadar...
AICOM
2007
61views more  AICOM 2007»
15 years 3 months ago
Scheduling social tournaments locally
Abstract. Tournament scheduling, such as the social golfer problem, has attracted significant attention in recent years because of their highly symmetrical and combinatorial natur...
Iván Dotú, Pascal Van Hentenryck
WADS
1997
Springer
89views Algorithms» more  WADS 1997»
15 years 8 months ago
Intractability of Assembly Sequencing: Unit Disks in the Plane
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
Michael H. Goldwasser, Rajeev Motwani
109
Voted
MOBICOM
2009
ACM
15 years 10 months ago
Optimal beam scheduling for multicasting in wireless networks
We consider the problem of efficient link-layer multicasting in wireless networks with switched beamforming antennas. The inherent tradeoff between multicasting and beamforming ...
Karthikeyan Sundaresan, Kishore Ramachandran, Samp...
128
Voted
ICC
2007
IEEE
142views Communications» more  ICC 2007»
15 years 10 months ago
On MAC Scheduling and Packet Combination Strategies for Practical Random Network Coding
— The present paper investigates practical algorithms to efficiently exploit random network coding for data delivery in multi-hop wireless networks. In the past few years, a gre...
Elena Fasolo, Michele Rossi, Jörg Widmer, Mic...