Image de couverture de livre

Equitable Connected Partition and Structural Parameters Revisited: N-fold Beats Lenstra

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Blažej, Václav, Knop, Dušan, Pokorný, Jan, Schierreich, Šimon
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Balancing the Spread of Two Opinions in Sparse Social Networks
par: Knop, Dušan, et autres
Publié: (2021)

Host Community Respecting Refugee Housing
par: Knop, Dušan, et autres
Publié: (2023)

Individual Rationality in Topological Distance Games is Surprisingly Hard
par: Deligkas, Argyrios, et autres
Publié: (2024)

Pathfinding in Self-Deleting Graphs
par: Dvořák, Michal, et autres
Publié: (2025)

Parameterized Critical Node Cut Revisited
par: Knop, Dušan, et autres
Publié: (2025)

On the Parameterized Complexity of Eulerian Strong Component Arc Deletion
par: Blažej, Václav, et autres
Publié: (2024)

Tractable Graph Structures in EFX Orientation
par: Blažej, Václav, et autres
Publié: (2025)

Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View
par: Hušek, Radek, et autres
Publié: (2020)

Dynamic framework for edge-connectivity maintenance of simple graphs
par: Wrobel, Blazej
Publié: (2026)

Connected Partitions via Connected Dominating Sets
par: Niklanovits, Aikaterini, et autres
Publié: (2025)

Finding a Maximum Common (Induced) Subgraph: Structural Parameters Revisited
par: Hanaka, Tesshu, et autres
Publié: (2025)

Parameterized Complexity of Scheduling Problems in Robotic Process Automation
par: Dvořák, Michal, et autres
Publié: (2026)

Exact Algorithms for Distance to Unique Vertex Cover
par: Fioravantes, Foivos, et autres
Publié: (2025)

Beating Competitive Ratio 4 for Graphic Matroid Secretary
par: Banihashem, Kiarash, et autres
Publié: (2025)

On Controlling Knockout Tournaments Without Perfect Information
par: Blažej, Václav, et autres
Publié: (2024)

Beating Bellman's Algorithm for Subset Sum
par: Bringmann, Karl, et autres
Publié: (2024)

Parameterized Complexity of Directed Traveling Salesman Problem
par: Blažej, Václav, et autres
Publié: (2025)

On Beating $2^n$ for the Closest Vector Problem
par: Abboud, Amir, et autres
Publié: (2025)

Online Makespan Minimization: Beat LPT by Dynamic Locking
par: Wang, Zhaozi, et autres
Publié: (2023)

Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number
par: Casel, Katrin, et autres
Publié: (2019)

Capacitated Partition Vertex Cover and Partition Edge Cover
par: Dabas, Rajni, et autres
Publié: (2025)

New Algorithm for Combinatorial $n$-folds and Applications
par: Jansen, Klaus, et autres
Publié: (2024)

New Algorithms and Hardness Results for Connected Clustering
par: Eube, Jan, et autres
Publié: (2025)

You (Almost) Can't Beat Brute Force for 3-Matroid Intersection
par: Doron-Arad, Ilan, et autres
Publié: (2024)

Using random spanning trees in survivable networks design
par: Wrobel, Blazej, et autres
Publié: (2025)

Dynamic Connectivity with Expected Polylogarithmic Worst-Case Update Time
par: Meierhans, Simon, et autres
Publié: (2025)

Parameterizing Path Partitions
par: Fernau, Henning, et autres
Publié: (2022)

Creating Robust and Fair Graph Structures for Connectivity and Clustering
par: Chatterjee, Kushagra
Publié: (2026)

Dichotomies for Tree Minor Containment with Structural Parameters
par: Gima, Tatsuya, et autres
Publié: (2023)

Monotone Submodular Multiway Partition
par: Bi, Richard, et autres
Publié: (2024)

Graph Partitioning With Limited Moves
par: Behbahani, Majid, et autres
Publié: (2024)

Path Partitions of Phylogenetic Networks
par: Lafond, Manuel, et autres
Publié: (2024)

Buffered Streaming Edge Partitioning
par: Chhabra, Adil, et autres
Publié: (2024)

Partition-based Simple Heaps
par: Brodal, Gerth Stølting, et autres
Publié: (2026)

Instance-Optimality in I/O-Efficient Sampling and Sequential Estimation
par: Narayanan, Shyam, et autres
Publié: (2024)

Online Stochastic Matching with Unknown Arrival Order: Beating $0.5$ against the Online Optimum
par: Sun, Enze, et autres
Publié: (2025)

Connected k-Median with Disjoint and Non-disjoint Clusters
par: Eube, Jan, et autres
Publié: (2025)

Fair Correlation Clustering Meets Graph Parameters
par: Blaha, Johannes, et autres
Publié: (2026)

Approximating Partition in Near-Linear Time
par: Chen, Lin, et autres
Publié: (2024)

Learning Partitions using Rank Queries
par: Chakrabarty, Deeparnab, et autres
Publié: (2024)