:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Li, Bo, Li, Lijun, Li, Minming, Zhang, Ruilong
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms
Acceso en línea:	https://arxiv.org/abs/2404.11879
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Fair Submodular Maximization over a Knapsack Constraint
por: Li, Lijun, et al.
Publicado: (2025)

Logarithmic Approximations for Fair k-Set Selection
por: Li, Shi, et al.
Publicado: (2025)

Polylogarithmic Approximation for Robust s-t Path
por: Li, Shi, et al.
Publicado: (2023)

Online Flexible Busy Time Scheduling on Heterogeneous Machines
por: Calinescu, Gruia, et al.
Publicado: (2024)

Dynamic Maximal Matching in Clique Networks
por: Li, Minming, et al.
Publicado: (2024)

Online Nash Welfare Maximization Without Predictions
por: Huang, Zhiyi, et al.
Publicado: (2022)

Multiagent Matroid Upgrading: Greedy is Fair and Efficient
por: Ma, Qingwen, et al.
Publicado: (2026)

Constant Approximation for Weighted Nash Social Welfare with Submodular Valuations
por: Feng, Yuda, et al.
Publicado: (2024)

New Convex Programming Technique for Nash Social Welfare and Scheduling
por: Feng, Yuda, et al.
Publicado: (2026)

Nash Social Welfare with Submodular Valuations: Approximation Algorithms and Integrality Gaps
por: Bei, Xiaohui, et al.
Publicado: (2025)

Combinatorial Perpetual Scheduling: Existence and Computation of Low-Height Schedules
por: Mendoza-Cadena, Mirabel, et al.
Publicado: (2026)

Job Scheduling under Base and Additional Fees, with Applications to Mixed-Criticality Scheduling
por: Hsieh, Yi-Ting, et al.
Publicado: (2025)

Competitive Non-Clairvoyant KV-Cache Scheduling for LLM Inference
por: Feng, Yiding, et al.
Publicado: (2026)

Collision-Free Robot Scheduling
por: Adamson, Duncan, et al.
Publicado: (2024)

Fixed Order Scheduling with Deadlines
por: Berger, Andre, et al.
Publicado: (2024)

Engineering Optimal Parallel Task Scheduling
por: Akram, Matthew, et al.
Publicado: (2024)

Scheduling on a Stochastic Number of Machines
por: Buchem, Moritz, et al.
Publicado: (2024)

Non-Clairvoyant Scheduling with Progress Bars
por: Benomar, Ziyad, et al.
Publicado: (2025)

Online Makespan Scheduling under Scenarios
por: Ergen, Ekin
Publicado: (2025)

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

Root-to-Leaf Scheduling in Write-Optimized Trees
por: Chung, Christopher, et al.
Publicado: (2024)

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

Online Drone Scheduling for Last-mile Delivery
por: Jana, Saswata, et al.
Publicado: (2024)

Scheduling Jobs with Work-Inefficient Parallel Solutions
por: Kuszmaul, William, et al.
Publicado: (2024)

Scheduling two types of jobs with minimum makespan
por: Cao, Song, et al.
Publicado: (2024)

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

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

Revoke vs. Restart in Unweighted Throughput Scheduling
por: He, Changdao
Publicado: (2025)

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

Smoothed Analysis of the k-Swap Neighborhood for Makespan Scheduling
por: Rohwedder, Lars, et al.
Publicado: (2024)

A k-swap Local Search for Makespan Scheduling
por: Rohwedder, Lars, et al.
Publicado: (2024)

LLM Query Scheduling with Prefix Reuse and Latency Constraints
por: Dexter, Gregory, et al.
Publicado: (2025)

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

Structural Results for High-Multiplicity Scheduling on Uniform Machines
por: Brinkop, Hauke, et al.
Publicado: (2022)

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

Bellman-Ford in Almost-Linear Time for Dense Graphs
por: Li, George Z., et al.
Publicado: (2026)

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

Scheduling on Identical Machines with Setup Time and Unknown Execution Time
por: Kawase, Yasushi, et al.
Publicado: (2025)

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling
por: Das, Rathish, et al.
Publicado: (2025)