Approximation Algorithms for Generalized Path Scheduling
From MaRDI portal
Publication:6065400
DOI10.4230/lipics.isaac.2020.10OpenAlexW3116777151MaRDI QIDQ6065400
Unnamed Author, Mohammad R. Salavatipour
Publication date: 14 November 2023
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2020/13354/pdf/LIPIcs-ISAAC-2020-10.pdf/
Cites Work
- Unnamed Item
- Approximation algorithms for shop scheduling problems with minsum objective: A correction
- Minimizing total weighted completion time in a proportionate flow shop
- Approximability of flow shop scheduling
- Makespan minimization in open shops: A polynomial time approximation scheme
- Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
- Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
- Scheduling problems over a network of machines
- A polynomial-time approximation scheme for the airplane refueling problem
- A \((2 + \epsilon)\)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
- Scheduling problems in transportation networks of line topology
- Better Approximation Guarantees for Job-Shop Scheduling
- Real-Time Message Routing and Scheduling
- Improved Approximation Algorithms for Shop Scheduling Problems
- Polynomial time approximation schemes for the traveling repairman and other minimum latency problems.
- Packet Forwarding Algorithms in a Line Network
- Constraint satisfaction, packet routing, and the lovasz local lemma
This page was built for publication: Approximation Algorithms for Generalized Path Scheduling
