Image de couverture de livre

Concurrency Constrained Scheduling with Tree-Like Constraints

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bodlaender, Hans L., Hermelin, Danny, van Leeuwen, Erik Jan
Format:	Preprint
Publié:	2025
Sujets:	Discrete Mathematics Computational Complexity 68Q25 (Primary) 90B35 (Secondary)
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases
par: Meusel, Julia, et autres
Publié: (2025)

On balanceable and simply balanceable regular graphs
par: Ahanjideh, Milad, et autres
Publié: (2024)

Vanishing of Schubert coefficients is in ${\sf AM}\cap {\sf coAM}$ assuming the GRH
par: Pak, Igor, et autres
Publié: (2025)

Vanishing of Schubert coefficients in probabilistic polynomial time
par: Pak, Igor, et autres
Publié: (2025)

On Vanishing of Gromov--Witten Invariants
par: Pak, Igor, et autres
Publié: (2025)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
par: Feldman, Moran, et autres
Publié: (2026)

Induced Disjoint Paths Without an Induced Minor
par: Aboulker, Pierre, et autres
Publié: (2025)

Toward P vs NP: An Observer-Theoretic Separation via SPDP Rank and a ZFC-Equivalent Foundation within the N-Frame Model
par: Edwards, Darren J.
Publié: (2025)

Vanishing of Schubert Coefficients
par: Pak, Igor, et autres
Publié: (2024)

Positivity of Schubert Coefficients
par: Pak, Igor, et autres
Publié: (2024)

Balanced connected partitions of edge-weighted graphs: Hardness and solving methods
par: Davari, Morteza, et autres
Publié: (2025)

An Algorithm to Recover Shredded Random Matrices
par: Atamanchuk, Caelan, et autres
Publié: (2023)

Complexity of learning matchings and half graphs via edge queries
par: Mande, Nikhil S., et autres
Publié: (2025)

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

Regenerative Ulam-von Neumann Algorithm: An Innovative Markov chain Monte Carlo Method for Matrix Inversion
par: Ghosh, Soumyadip, et autres
Publié: (2024)

Reconfiguring homomorphisms to reflexive graphs via a simple reduction
par: Mühlenthaler, Moritz, et autres
Publié: (2024)

ETH-Tight Complexity of Optimal Morse Matching on Bounded-Treewidth Complexes
par: Philip, Geevarghese, et autres
Publié: (2026)

SMB algebras II: On the Constraint Satisfaction Problem over Semilattices of Mal'cev Blocks
par: Marković, Petar, et autres
Publié: (2026)

On the Parenthesisations of Matrix Chains: All are Useful, Few Are Essential
par: López, Francisco, et autres
Publié: (2023)

On Stable Cutsets in General and Minimum Degree Constrained Graphs
par: Vroon, Mats, et autres
Publié: (2025)

Answering Related Questions
par: Bonnet, Édouard
Publié: (2025)

Coloring Hardness on Low Twin-Width Graphs
par: Bonnet, Édouard
Publié: (2025)

Leakage-Resilient Hardness Equivalence to Logspace Derandomization
par: Shalunov, Yakov
Publié: (2023)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
par: Buchbinder, Niv, et autres
Publié: (2024)

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

A scalable clustering algorithm to approximate graph cuts
par: Suchan, Leo, et autres
Publié: (2023)

Quantum computing algorithms for inverse problems on graphs and an NP-complete inverse problem
par: Ilmavirta, Joonas, et autres
Publié: (2023)

Constraint Satisfaction Problems over Finitely Bounded Homogeneous Structures: a Dichotomy between FO and L-hard
par: Dorochko, Leonid, et autres
Publié: (2026)

The Upper Clique Transversal Problem
par: Milanič, Martin, et autres
Publié: (2023)

4-cop-win graphs have at least 19 vertices
par: Turcotte, Jérémie, et autres
Publié: (2020)

Reduction of the group isomorphism problem to the group automorphism problem
par: Skresanov, Saveliy V.
Publié: (2025)

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

Revisiting Chazelle's Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
par: Michel, Stefan
Publié: (2025)

P not equal to NP
par: Delgado, Daniel Cardona
Publié: (2023)

Robust Graph-Based Semi-Supervised Learning via $p$-Conductances
par: Robertson, Sawyer Jack, et autres
Publié: (2025)

Finding Cliques in Geometric Intersection Graphs with Grounded or Stabbed Constraints
par: Keil, J. Mark, et autres
Publié: (2025)

A Bellman-Ford algorithm for the path-length-weighted distance in graphs
par: Arnau, R., et autres
Publié: (2024)

Probabilistic Analysis of Edge Elimination for Euclidean TSP
par: Zhong, Xianghui
Publié: (2018)

Bicriteria Submodular Maximization
par: Feldman, Moran, et autres
Publié: (2025)

Online Convex Optimization Using Coordinate Descent Algorithms
par: Lin, Yankai, et autres
Publié: (2022)