1. On Approximation Ratios of Minimum-Energy Multicast Routing in Wireless Networks

   • Hongxu Cai
   • Yingchao Zhao

   OriginalPaper Pages: 243 - 262

2. On 3-Stage Clos Networks with Different Nonblocking Requirements on Two Types of Calls

   • Hung-Lin Fu
   • Frank K. Hwang

   OriginalPaper Pages: 263 - 266

3. Perfect Circular Arc Coloring

   • Xujin Chen
   • Zhiquan Hu
   • Wenan Zang

   OriginalPaper Pages: 267 - 280

4. The Polymatroid Steiner Problems

   • G. Calinescu
   • A. Zelikovsky

   OriginalPaper Pages: 281 - 294

5. On the Hardness of Approximating the Min-Hack Problem

   • Ramkumar Chinchani
   • Duc Ha
   • Shambhu Upadhyaya

   OriginalPaper Pages: 295 - 311

6. A Framework for the Complexity of High-Multiplicity Scheduling Problems

   • N. Brauner
   • Y. Crama
   • J. van de Klundert

   OriginalPaper Pages: 313 - 323