Copertina

Polynomial-Time Algorithms for Weaver's Discrepancy Problem in a Dense Regime

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Jourdan, Ben, Macgregor, Peter, Sun, He
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Coreset Spectral Clustering
di: Jourdan, Ben, et al.
Pubblicazione: (2025)

Polynomial Time Algorithms for Integer Programming and Unbounded Subset Sum in the Total Regime
di: Aggarwal, Divesh, et al.
Pubblicazione: (2024)

Spectral Toolkit of Algorithms for Graphs: Technical Report (2)
di: Macgregor, Peter, et al.
Pubblicazione: (2024)

Dynamic Similarity Graph Construction with Kernel Density Estimation
di: Laenen, Steinar, et al.
Pubblicazione: (2025)

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

A Polynomial-Time Algorithm for the Next-to-Shortest Path Problem on Positively Weighted Directed Graphs
di: Chen, Kuowen, et al.
Pubblicazione: (2025)

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

Dynamic DBSCAN with Euler Tour Sequences
di: Shin, Seiyun, et al.
Pubblicazione: (2025)

A Polynomial Time Algorithm for Steiner Tree when Terminals Avoid a $K_4$-Minor
di: Groenland, Carla, et al.
Pubblicazione: (2024)

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity
di: Tayal, Mumuksh
Pubblicazione: (2025)

A Polynomial time Algorithm for 3SAT
di: Du, Lizhi
Pubblicazione: (2010)

On Tight FPT Time Approximation Algorithms for k-Clustering Problems
di: Dai, Han, et al.
Pubblicazione: (2025)

The Discrepancy of Shortest Paths
di: Bodwin, Greg, et al.
Pubblicazione: (2024)

Mini-Batch Kernel $k$-means
di: Jourdan, Ben, et al.
Pubblicazione: (2024)

Hypergraph Unreliability in Quasi-Polynomial Time
di: Cen, Ruoxu, et al.
Pubblicazione: (2024)

Directed and Undirected Vertex Connectivity Problems are Equivalent for Dense Graphs
di: Fischer, Olivier, et al.
Pubblicazione: (2025)

Split Algorithm in Linear Time for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Windows
di: Gibbons, Ethan, et al.
Pubblicazione: (2026)

Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms
di: Caroppo, Susanna, et al.
Pubblicazione: (2025)

Faster Algorithm for Bounded Tree Edit Distance in the Low-Distance Regime
di: Kociumaka, Tomasz, et al.
Pubblicazione: (2025)

An $\mathcal{O}(\log N)$ Time Algorithm for the Generalized Egg Dropping Problem
di: Papadopoulos, Kleitos
Pubblicazione: (2026)

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

A Framework for Parameterized Subexponential-Subcubic-Time Algorithms for Weighted Problems in Planar Graphs
di: Bentert, Matthias, et al.
Pubblicazione: (2026)

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

A Branch-and-Bound Approach for Maximum Low-Diameter Dense Subgraph Problems
di: Zhou, Yi, et al.
Pubblicazione: (2025)

Edge-Minimum Walk of Modular Length in Polynomial Time
di: Amarilli, Antoine, et al.
Pubblicazione: (2024)

Counting and Sampling Labeled Chordal Graphs in Polynomial Time
di: Hebert-Johnson, Ursula, et al.
Pubblicazione: (2023)

Sampling Unlabeled Chordal Graphs in Expected Polynomial Time
di: Hébert-Johnson, Úrsula, et al.
Pubblicazione: (2025)

A Polynomial-time Algorithm for Detecting the Possibility of Braess Paradox in Directed Graphs
di: Cenciarelli, Pietro, et al.
Pubblicazione: (2016)

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

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering
di: Nezhad, Sina Bagheri, et al.
Pubblicazione: (2025)

A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs
di: S, Ajaykrishnan E, et al.
Pubblicazione: (2025)

Parameterized Algorithms for the Steiner Arborescence Problem on a Hypercube
di: Mahapatra, Sugyani, et al.
Pubblicazione: (2021)

A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs
di: Sun, Ming, et al.
Pubblicazione: (2022)

An Exact Algorithm for the Unanimous Vote Problem
di: Keles, Feyza Duman, et al.
Pubblicazione: (2025)

Parameterized Algorithms for the Drone Delivery Problem
di: Bartlmae, Simon, et al.
Pubblicazione: (2026)

Lipschitz Continuous Algorithms for Covering Problems
di: Kumabe, Soh, et al.
Pubblicazione: (2023)

Fully Polynomial-time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication
di: Bentert, Matthias, et al.
Pubblicazione: (2024)

KD-Club: An Efficient Exact Algorithm with New Coloring-based Upper Bound for the Maximum k-Defective Clique Problem
di: Jin, Mingming, et al.
Pubblicazione: (2023)

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

A Fully Polynomial-Time Algorithm for Robustly Learning Halfspaces over the Hypercube
di: Chandrasekaran, Gautam, et al.
Pubblicazione: (2025)