Image de couverture de livre

A Parametrized Complexity View on Robust Scheduling with Budgeted Uncertainty

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Goldberg, Noam, Shabtay, Dvir
Format:	Preprint
Publié:	2026
Sujets:	Discrete Mathematics 90 F.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Robust Permutation Flowshops Under Budgeted Uncertainty
par: Goldberg, Noam, et autres
Publié: (2026)

Shared Processor Scheduling of Multiprocessor Jobs
par: Dereniowski, Dariusz, et autres
Publié: (2018)

Robust Extensible Bin Packing and Revisiting the Convex Knapsack Problem
par: Goldberg, Noam, et autres
Publié: (2025)

Scarf's Algorithm on Arborescence Hypergraphs
par: Chandrasekaran, Karthekeyan, et autres
Publié: (2024)

Loop unrolling of UCA models: distance labeling
par: Soulignac, Francisco J, et autres
Publié: (2022)

Relaxation strength for multilinear optimization: McCormick strikes back
par: Schutte, Emily, et autres
Publié: (2023)

On the complexity of a maintenance problem for hierarchical systems
par: Schulz, Andreas S., et autres
Publié: (2023)

On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy
par: Grüne, Christoph, et autres
Publié: (2024)

Graph burning: an overview of mathematical programs
par: Cajica-Maceda, Lourdes Beatriz, et autres
Publié: (2025)

Faster Lattice Basis Computation via a Natural Generalization of the Euclidean Algorithm
par: Klein, Kim-Manuel, et autres
Publié: (2024)

Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs
par: Büngener, Aaron, et autres
Publié: (2024)

Complexity of Firefighting on Graphs
par: Althoetmar, Julius, et autres
Publié: (2025)

Flow Shop Scheduling with Inter-Stage Flexibility and Blocking Constraints
par: Nicosia, Gaia, et autres
Publié: (2024)

A Compendium of Subset Search Problems and Reductions relating to the Parsimonious Property
par: Bartlett, Celina Janet
Publié: (2025)

The Complexity of Blocking All Solutions
par: Grüne, Christoph, et autres
Publié: (2025)

Intersection patterns of set systems on manifolds with slowly growing homological shatter functions
par: Avvakumov, Sergey, et autres
Publié: (2026)

On the Connectivity of the Flip Graph of Plane Spanning Paths
par: Kleist, Linda, et autres
Publié: (2024)

Completeness in the Polynomial Hierarchy for many natural Problems in Bilevel and Robust Optimization
par: Grüne, Christoph, et autres
Publié: (2023)

A polynomial-time algorithm for recognizing high-bandwidth graphs
par: Varona, Luis M. B.
Publié: (2026)

A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graph and Trees
par: Jacob, Ashwin, et autres
Publié: (2026)

On Minimum Maximal Distance-k Matchings
par: Kartynnik, Yury, et autres
Publié: (2016)

Deterministic Minimum Steiner Cut in Maximum Flow Time
par: Ding, Matthew, et autres
Publié: (2023)

Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
par: Eiben, Eduard, et autres
Publié: (2023)

The steady-states of splitter networks
par: Couëtoux, Basile, et autres
Publié: (2024)

Forward-backward Contention Resolution Schemes for Fair Rationing
par: Ma, Will, et autres
Publié: (2025)

An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding
par: Ibrahimpur, Sharat, et autres
Publié: (2025)

The frequency $K_i$s for symmetrical traveling salesman problem
par: Wang, Yong
Publié: (2025)

Price Optimal Routing in Public Transportation
par: Euler, Ricardo, et autres
Publié: (2022)

Faster algorithms on linear delta-matroids
par: Koana, Tomohiro, et autres
Publié: (2024)

Flipping odd matchings in geometric and combinatorial settings
par: Aichholzer, Oswin, et autres
Publié: (2025)

A new density limit for unanimity in majority dynamics on random graphs
par: Kim, Jeong Han, et autres
Publié: (2025)

New Results on Edge-coloring and Total-coloring of Split Graphs
par: Couto, Fernanda, et autres
Publié: (2023)

On the Integrality Gap of Directed Steiner Tree LPs with Relatively Integral Solutions
par: Laekhanukit, Bundit
Publié: (2024)

Slow Convergence of Ising and Spin Glass Models with Well-Separated Frustrated Vertices
par: Gillman, David, et autres
Publié: (2026)

Optimizing Travel Time and Regenerative Energy for Periodic Timetables
par: Roth, Sarah, et autres
Publié: (2026)

On λ-backbone coloring of cliques with tree backbones in linear time
par: Michalik, Krzysztof, et autres
Publié: (2021)

Online Bipartite Matching in the Probe-Commit Model
par: Borodin, Allan, et autres
Publié: (2023)

Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities
par: Ma, Will, et autres
Publié: (2024)

On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
par: MacRury, Calum, et autres
Publié: (2022)

Algorithmic Applications of Tyshkevich's Graph Decomposition: A Primer and a Toolkit
par: Cheng, Christine T., et autres
Publié: (2026)