A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs
Fuente:
arXiv
Saved in:
| Main Authors: | Singh, Rajpreet, Boškov, Novak, Gudal, Aditya, Khan, Manzoor A. |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
CSR-RAG: An Efficient Retrieval System for Text-to-SQL on the Enterprise Scale
by: Singh, Rajpreet, et al.
Published: (2026)
by: Singh, Rajpreet, et al.
Published: (2026)
Online Scheduling via Gradient Descent for Weighted Flow Time Minimization
by: Chen, Qingyun, et al.
Published: (2024)
by: Chen, Qingyun, et al.
Published: (2024)
Mimicking Networks for Constrained Multicuts in Hypergraphs
by: Cho, Kyungjin, et al.
Published: (2024)
by: Cho, Kyungjin, et al.
Published: (2024)
Approximating Optimum Online for Capacitated Resource Allocation
by: Braun, Alexander, et al.
Published: (2024)
by: Braun, Alexander, et al.
Published: (2024)
A Black-Box Approach for Exogenous Replenishment in Online Resource Allocation
by: Kang, Suho, et al.
Published: (2025)
by: Kang, Suho, et al.
Published: (2025)
Asymptotically Optimal Competitive Ratio for Online Allocation of Reusable Resources
by: Goyal, Vineet, et al.
Published: (2020)
by: Goyal, Vineet, et al.
Published: (2020)
Efficient Resource Allocation under Adversary Attacks: A Decomposition-Based Approach
by: Davoodi, Mansoor, et al.
Published: (2025)
by: Davoodi, Mansoor, et al.
Published: (2025)
Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling
by: Das, Rathish, et al.
Published: (2025)
by: Das, Rathish, et al.
Published: (2025)
Hyper-distance Oracles in Hypergraphs
by: Preti, Giulia, et al.
Published: (2023)
by: Preti, Giulia, et al.
Published: (2023)
Sketching Cuts in Graphs and Hypergraphs
by: Kogan, Dmitry, et al.
Published: (2014)
by: Kogan, Dmitry, et al.
Published: (2014)
$\ell_2/\ell_2$ Sparse Recovery via Weighted Hypergraph Peeling
by: Fischer, Nick, et al.
Published: (2025)
by: Fischer, Nick, et al.
Published: (2025)
Parameterized Complexity of Scheduling Problems in Robotic Process Automation
by: Dvořák, Michal, et al.
Published: (2026)
by: Dvořák, Michal, et al.
Published: (2026)
Compressing Hypergraphs using Suffix Sorting
by: Adler, Enno, et al.
Published: (2025)
by: Adler, Enno, et al.
Published: (2025)
Semi-Streaming Algorithms for Hypergraph Matching
by: Reinstädtler, Henrik, et al.
Published: (2025)
by: Reinstädtler, Henrik, et al.
Published: (2025)
Transitivity Preserving Projection in Directed Hypergraphs
by: Parsonage, Eric, et al.
Published: (2025)
by: Parsonage, Eric, et al.
Published: (2025)
Fully Dynamic Spectral Sparsification of Hypergraphs
by: Goranci, Gramoz, et al.
Published: (2025)
by: Goranci, Gramoz, et al.
Published: (2025)
Hypergraph Unreliability in Quasi-Polynomial Time
by: Cen, Ruoxu, et al.
Published: (2024)
by: Cen, Ruoxu, et al.
Published: (2024)
Engineering Hypergraph $b$-Matching Algorithms
by: Großmann, Ernestine, et al.
Published: (2024)
by: Großmann, Ernestine, et al.
Published: (2024)
Efficient Parallel Algorithms for Hypergraph Matching
by: Reinstädtler, Henrik, et al.
Published: (2026)
by: Reinstädtler, Henrik, et al.
Published: (2026)
HybHuff: Lossless Compression for Hypergraphs via Entropy-Guided Huffman-Bitwise Coordination
by: Zhao, Tianyu, et al.
Published: (2025)
by: Zhao, Tianyu, et al.
Published: (2025)
Disjoint Paths in Expanders in Deterministic Almost-Linear Time via Hypergraph Perfect Matching
by: Bucić, Matija, et al.
Published: (2025)
by: Bucić, Matija, et al.
Published: (2025)
Course Allocation with Credits via Stable Matching
by: Rodríguez, José, et al.
Published: (2025)
by: Rodríguez, José, et al.
Published: (2025)
Temporal Routing in Static Networks: The Schedule Completion Problem
by: Döring, Michelle, et al.
Published: (2026)
by: Döring, Michelle, et al.
Published: (2026)
Sublinear Edge Fault Tolerant Spanners for Hypergraphs
by: He, Jialin, et al.
Published: (2025)
by: He, Jialin, et al.
Published: (2025)
Fully Dynamic Spectral Sparsification for Directed Hypergraphs
by: Forster, Sebastian, et al.
Published: (2025)
by: Forster, Sebastian, et al.
Published: (2025)
Near-Optimal Minimum Cuts in Hypergraphs at Scale
by: Chhabra, Adil, et al.
Published: (2025)
by: Chhabra, Adil, et al.
Published: (2025)
Almost Tight Bounds for Online Hypergraph Matching
by: Tröbst, Thorben, et al.
Published: (2024)
by: Tröbst, Thorben, et al.
Published: (2024)
Overlapping and Robust Edge-Colored Clustering in Hypergraphs
by: Crane, Alex, et al.
Published: (2023)
by: Crane, Alex, et al.
Published: (2023)
Improved Certificates for Independence Number in Semirandom Hypergraphs
by: Kothari, Pravesh, et al.
Published: (2026)
by: Kothari, Pravesh, et al.
Published: (2026)
Cut Sparsification and Succinct Representation of Submodular Hypergraphs
by: Kenneth, Yotam, et al.
Published: (2023)
by: Kenneth, Yotam, et al.
Published: (2023)
Approximation Algorithms for Scheduling Crowdsourcing Tasks in Mobile Social Networks
by: Chen, Chi-Yeh
Published: (2025)
by: Chen, Chi-Yeh
Published: (2025)
Solving Hypergraph Laplacian Systems in Almost-Linear Time
by: Yoshida, Yuichi
Published: (2026)
by: Yoshida, Yuichi
Published: (2026)
Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks
by: Chen, Chi-Yeh
Published: (2025)
by: Chen, Chi-Yeh
Published: (2025)
Improved Algorithms for Unrelated Crowd Worker Scheduling in Mobile Social Networks
by: Chen, Chi-Yeh
Published: (2026)
by: Chen, Chi-Yeh
Published: (2026)
Confluence of the Node-Domination and Edge-Domination Hypergraph Rewrite Rules
by: Amarilli, Antoine, et al.
Published: (2025)
by: Amarilli, Antoine, et al.
Published: (2025)
New Graph and Hypergraph Container Lemmas with Applications in Property Testing
by: Blais, Eric, et al.
Published: (2024)
by: Blais, Eric, et al.
Published: (2024)
Near-optimal Size Linear Sketches for Hypergraph Cut Sparsifiers
by: Khanna, Sanjeev, et al.
Published: (2024)
by: Khanna, Sanjeev, et al.
Published: (2024)
FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs
by: Lanzinger, Matthias, et al.
Published: (2023)
by: Lanzinger, Matthias, et al.
Published: (2023)
Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs
by: Khanna, Sanjeev, et al.
Published: (2024)
by: Khanna, Sanjeev, et al.
Published: (2024)
Data Reductions for the Strong Maximum Independent Set Problem in Hypergraphs
by: Großmann, Ernestine, et al.
Published: (2026)
by: Großmann, Ernestine, et al.
Published: (2026)
Similar Items
-
CSR-RAG: An Efficient Retrieval System for Text-to-SQL on the Enterprise Scale
by: Singh, Rajpreet, et al.
Published: (2026) -
Online Scheduling via Gradient Descent for Weighted Flow Time Minimization
by: Chen, Qingyun, et al.
Published: (2024) -
Mimicking Networks for Constrained Multicuts in Hypergraphs
by: Cho, Kyungjin, et al.
Published: (2024) -
Approximating Optimum Online for Capacitated Resource Allocation
by: Braun, Alexander, et al.
Published: (2024) -
A Black-Box Approach for Exogenous Replenishment in Online Resource Allocation
by: Kang, Suho, et al.
Published: (2025)