𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A dynamic edge covering and scheduling problem: complexity results and approximation algorithms

✍ Scribed by Jiaming Qiu, Thomas C. Sharkey

Book ID
120885632
Publisher
Springer-Verlag
Year
2013
Tongue
English
Weight
193 KB
Volume
8
Category
Article
ISSN
1862-4472

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Complexity and approximation results for
Complexity and approximation results for scheduling multiprocessor tasks on a ring
✍ Giuseppe Confessore; Paolo Dell'Olmo; Stefano Giordani πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 398 KB

We study a multiprocessor task scheduling problem, in which each task requires a set of processors with consecutiveness constraints to be executed. This occurs, for example, when multiple processors are interconnected by communication means, and the minimization of communication time may require the

Near-optimal hardness results and approx
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
✍ Venkatesan Guruswami; Sanjeev Khanna; Rajmohan Rajaraman; Bruce Shepherd; Mihali πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 308 KB

We study the approximability of edge-disjoint paths and related problems. In the edge-disjoint paths (EDP) problem, we are given a network G with source-sink pairs ðs i ; t i Þ; 1pipk; and the goal is to find a largest subset of source-sink pairs that can be simultaneously connected in an edge-disjo