Imagen de Portada

Minimizing $\ell_2$ Norm of Flow Time by Starvation Mitigation

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Kuo, Tung-Wei
Formato:	Preprint
Publicado:	2021
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line
por: Kuo, Tung-Wei
Publicado: (2024)

Online Flow Time Minimization with Gradually Revealed Jobs
por: Lindermayr, Alexander, et al.
Publicado: (2026)

Online Flow Time Minimization: Tight Bounds for Non-Preemptive Algorithms
por: Geng, Yutong, et al.
Publicado: (2025)

Online Scheduling via Gradient Descent for Weighted Flow Time Minimization
por: Chen, Qingyun, et al.
Publicado: (2024)

$\ell_2/\ell_2$ Sparse Recovery via Weighted Hypergraph Peeling
por: Fischer, Nick, et al.
Publicado: (2025)

A $2\ell k$ Kernel for $\ell$-Component Order Connectivity
por: Kumar, Mithilesh, et al.
Publicado: (2016)

The Cost of Compression: Tight Quadratic Black-Box Attacks on Sketches for $\ell_2$ Norm Estimation
por: Ahmadian, Sara, et al.
Publicado: (2025)

Clustering to Minimize Cluster-Aware Norm Objectives
por: Herold, Martin G., et al.
Publicado: (2024)

Maximum Flow by Augmenting Paths in $n^{2+o(1)}$ Time
por: Bernstein, Aaron, et al.
Publicado: (2024)

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

Discrepancy Minimization in Input-Sparsity Time
por: Deng, Yichuan, et al.
Publicado: (2022)

Approximation Algorithms for $\ell_p$-Shortest Path and $\ell_p$-Group Steiner Tree
por: Makarychev, Yury, et al.
Publicado: (2024)

An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
por: Blankenburg, Daniel, et al.
Publicado: (2025)

Supermodular Approximation of Norms and Applications
por: Kesselheim, Thomas, et al.
Publicado: (2024)

Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time
por: Fischer, Nick, et al.
Publicado: (2024)

Optimally detecting uniformly-distributed $\ell_2$ heavy hitters in data streams
por: Velusamy, Santhoshini, et al.
Publicado: (2025)

On Finding $\ell$-th Smallest Perfect Matchings
por: Maalouly, Nicolas El, et al.
Publicado: (2025)

Dynamic Metric Embedding into $\ell_p$ Space
por: Banihashem, Kiarash, et al.
Publicado: (2024)

Minimizing Reachability Times on Temporal Graphs via Shifting Labels
por: Deligkas, Argyrios, et al.
Publicado: (2021)

Faster Minimization of Total Weighted Completion Time on Parallel Machines
por: Hermelin, Danny, et al.
Publicado: (2025)

Minimizing Makespan in Sublinear Time via Weighted Random Sampling
por: Fu, Bin, et al.
Publicado: (2026)

Improved Online Load Balancing in the Two-Norm
por: Borst, Sander, et al.
Publicado: (2025)

Algorithms and Hardness Results for the $(k,\ell)$-Cover Problem
por: Madani, Amirali, et al.
Publicado: (2025)

Faster Approximate Fixed Points of $\ell_\infty$-Contractions
por: Feodorov, Andrei, et al.
Publicado: (2026)

Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines
por: Heeger, Klaus, et al.
Publicado: (2024)

Minimizing Total Travel Time for Collaborative Package Delivery with Heterogeneous Drones
por: Erlebach, Thomas, et al.
Publicado: (2026)

Minimizing the Minimizers via Alphabet Reordering
por: Verbeek, Hilde, et al.
Publicado: (2024)

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

Minimum-Peak-Cost Flows Over Time
por: Anapolska, Mariia, et al.
Publicado: (2025)

Optimal bounds for $\ell_p$ sensitivity sampling via $\ell_2$ augmentation
por: Munteanu, Alexander, et al.
Publicado: (2024)

Simultaneously Approximating All Norms for Massively Parallel Correlation Clustering
por: Cao, Nairen, et al.
Publicado: (2024)

Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously
por: Kaul, Matthias, et al.
Publicado: (2025)

FPT Approximations for Fair Sum of Radii with Outliers and General Norm Objectives
por: Gadekar, Ameet
Publicado: (2026)

New Results on a General Class of Minimum Norm Optimization Problems
por: Chen, Kuowen, et al.
Publicado: (2025)

A Strong Separation for Adversarially Robust $\ell_0$ Estimation for Linear Sketches
por: Gribelyuk, Elena, et al.
Publicado: (2024)

A Simpler Analysis for $\varepsilon$-Clairvoyant Flow Time Scheduling
por: Gupta, Anupam, et al.
Publicado: (2026)

Generalized Flow in Nearly-linear Time on Moderately Dense Graphs
por: Jiang, Shunhua, et al.
Publicado: (2025)

Unbiased Insights: Optimal Streaming Algorithms for $\ell_p$ Sampling, the Forget Model, and Beyond
por: Lin, Honghao, et al.
Publicado: (2025)

The $\ell_p$-Subspace Sketch Problem in Small Dimensions with Applications to Support Vector Machines
por: Li, Yi, et al.
Publicado: (2022)

Generalized $k$-Center: Distinguishing Doubling and Highway Dimension
por: Feldmann, Andreas Emil, et al.
Publicado: (2022)