Graph Algorithms with Small Communication Costs Jieliang ZhouPatrick DymondXiaotie Deng OriginalPaper Pages: 291 - 305
Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling Piotr BermanBhaskar Dasgupta OriginalPaper Pages: 307 - 323
A Probabilistic Feasibility and Value Analysis of the Generalized Assignment Problem H. Edwin RomeijnNanda Piersma OriginalPaper Pages: 325 - 355
Polynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence Problem Bing LuLu Ruan OriginalPaper Pages: 357 - 363
Facets of an Assignment Problem with 0–1 Side Constraint Abdo Y. AlfakihTongnyoul YiKatta G. Murty OriginalPaper Pages: 365 - 388