Minimum Cost Edge Subset Covering Exactly k Vertices of a Graph Jáan Plesník OriginalPaper Pages: 275 - 286
On Approximating a Scheduling Problem Pierluigi CrescenziXiaotie DengChristos H. Papadimitriou OriginalPaper Pages: 287 - 297
A \({{10}}\)-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem Robert CarrToshihiro FujitoOjas Parekh OriginalPaper Pages: 317 - 326
A Polynomial Time Approximation Scheme for the Problem of Interconnecting Highways Xiuzhen ChengJoon-Mo KimBing Lu OriginalPaper Pages: 327 - 343
Combinatorial Optimization in Real-Time Scheduling: Theory and Algorithms Shyh-In HwangSheng-Tzong Cheng OriginalPaper Pages: 345 - 375