Cover Image

Algorithmic Reductions: Network Flow and NP-Completeness in Real-World Scheduling Problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Sinhal, Anay, Sinhal, Arpana, Sinhal, Amit, Hirawat, Amit
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Federated Continual Learning for Privacy-Preserving Hospital Imaging Classification
by: Sinhal, Anay, et al.
Published: (2026)

Stress Monitoring in Healthcare: An Ensemble Machine Learning Framework Using Wearable Sensor Data
by: Sinhal, Arpana, et al.
Published: (2025)

Global Predecessor Indexing: Avoiding Binary Search in Weighted Job Scheduling
by: Joshi, Amit
Published: (2025)

Temporal Routing in Static Networks: The Schedule Completion Problem
by: Döring, Michelle, et al.
Published: (2026)

Efficient Algorithms for Disjoint Shortest Paths Problem and its Extensions
by: Choudhary, Keerti, et al.
Published: (2025)

DNA Probe Computing System for Solving NP-Complete Problems
by: Xu, Jin, et al.
Published: (2025)

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems
by: Bampis, Evripidis, et al.
Published: (2025)

An Invitation to "Fine-grained Complexity of NP-Complete Problems"
by: Nederlof, Jesper
Published: (2026)

An FPT Algorithm for the Exact Matching Problem and NP-hardness of Related Problems
by: Murakami, Hitoshi, et al.
Published: (2024)

NP-Completeness for the Space-Optimality of Double-Array Tries
by: Bannai, Hideo, et al.
Published: (2024)

The Buffer Minimization Problem for Scheduling Flow Jobs with Conflicts
by: Haas, Niklas, et al.
Published: (2025)

Packing-Inspired Algorithms for Periodic Scheduling Problems with Harmonic Periods
by: Grus, Josef, et al.
Published: (2024)

Multi-Way Co-Ranking: Index-Space Partitioning of Sorted Sequences Without Merge
by: Joshi, Amit
Published: (2025)

A Reduction-based Algorithm for the Clique Interdiction Problem
by: Zhu, Chenghao, et al.
Published: (2025)

Online Algorithms to Schedule a Proportionate Flexible Flow Shop of Batching Machines
by: Hertrich, Christoph, et al.
Published: (2020)

Total Completion Time Scheduling Under Scenarios
by: Bosman, Thomas, et al.
Published: (2024)

Approximation Algorithms for Scheduling Crowdsourcing Tasks in Mobile Social Networks
by: Chen, Chi-Yeh
Published: (2025)

A Polynomial-Time Deterministic Algorithm for an NP-Complete Problem
by: Jiang, Xinwen, et al.
Published: (2021)

Almost-Uniform Edge Sampling: Leveraging Independent-Set and Local Graph Queries
by: Adar, Tomer, et al.
Published: (2026)

Clustering What Matters in Constrained Settings
by: Jaiswal, Ragesh, et al.
Published: (2023)

Finding missing items requires strong forms of randomness
by: Chakrabarti, Amit, et al.
Published: (2023)

Improved Algorithms for Unrelated Crowd Worker Scheduling in Mobile Social Networks
by: Chen, Chi-Yeh
Published: (2026)

Parsimonious Learning-Augmented Approximations for Dense Instances of $\mathcal{NP}$-hard Problems
by: Bampis, Evripidis, et al.
Published: (2024)

A Near-Real-Time Reduction-Based Algorithm for Coloring Massive Graphs
by: Zhu, Chenghao, et al.
Published: (2025)

A General Reduction for High-Probability Analysis with General Light-Tailed Distributions
by: Attia, Amit, et al.
Published: (2024)

Crane Scheduling Problem with Energy Saving
by: Gao, Yixiong, et al.
Published: (2025)

Approximation Algorithms for Fair Repetitive Scheduling
by: Hermelin, Danny, et al.
Published: (2025)

Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems
by: Bhore, Sujoy, et al.
Published: (2026)

An Algorithm for Fast and Correct Computation of Reeb Spaces for PL Bivariate Fields
by: Chattopadhyay, Amit, et al.
Published: (2024)

Finite Pinwheel Scheduling: the k-Visits Problem
by: Kanellopoulos, Sotiris, et al.
Published: (2025)

Weighted Chairman Assignment and Flow-Time Scheduling
by: Liu, Siyue, et al.
Published: (2025)

Recognizing Sumsets is NP-Complete
by: Abboud, Amir, et al.
Published: (2024)

An Empirical Study of Online Packet Scheduling Algorithms
by: Sakr, Nourhan, et al.
Published: (2016)

NP-Hardness and a PTAS for the Pinwheel Problem
by: Kleinberg, Robert, et al.
Published: (2026)

When Local and Non-Local Meet: Quadratic Improvement for Edge Estimation with Independent Set Queries
by: Adar, Tomer, et al.
Published: (2026)

Robust-Sorting and Applications to Ulam-Median
by: Jaiswal, Ragesh, et al.
Published: (2025)

A Tight Competitive Ratio for Online Submodular Welfare Maximization
by: Ganz, Amit, et al.
Published: (2023)

FPT Approximation for Capacitated Sum of Radii
by: Jaiswal, Ragesh, et al.
Published: (2024)

Improved Bounds for High-Dimensional Equivalence and Product Testing using Subcube Queries
by: Adar, Tomer, et al.
Published: (2024)

Support Testing in the Huge Object Model
by: Adar, Tomer, et al.
Published: (2023)