most citedAn improved bound for the price of anarchy for related machine scheduling

1 citations · 1 across the 1 of their papers we have counts for

collaborators
Showing cs.DSShow all

2 papers · 1 filter

cs.DS2025

Cost Preserving Dependent Rounding for Allocation Problems

Lars Rohwedder, Arman Rouhani, Leo Wennmann

We present a dependent randomized rounding scheme, which rounds fractional solutions to integral solutions satisfying certain hard constraints on the output while preserving Cherno…

cs.DS2024

Fixed Order Scheduling with Deadlines

Andre Berger, Arman Rouhani, Marc Schröder

This paper studies a scheduling problem in a parallel machine setting, where each machine must adhere to a predetermined fixed order for processing the jobs. Given jobs, each w…