Image de couverture de livre

Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bentert, Matthias, Fomin, Fedor V., Inamdar, Tanmay, Saurabh, Saket
Format:	Preprint
Publié:	2025
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

Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths
par: Bentert, Matthias, et autres
Publié: (2024)

The Parameterized Complexity Landscape of Two-Sets Cut-Uncut
par: Bentert, Matthias, et autres
Publié: (2024)

A Framework for Parameterized Subexponential-Subcubic-Time Algorithms for Weighted Problems in Planar Graphs
par: Bentert, Matthias, et autres
Publié: (2026)

Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization
par: Fomin, Fedor V., et autres
Publié: (2025)

Parameterized Geometric Graph Modification with Disk Scaling
par: Fomin, Fedor V., et autres
Publié: (2024)

Hybrid k-Clustering: Blending k-Median and k-Center
par: Fomin, Fedor V., et autres
Publié: (2024)

Cuts in Graphs with Matroid Constraints
par: Banik, Aritra, et autres
Publié: (2024)

FPT Approximations for Connected Maximum Coverage
par: Inamdar, Tanmay, et autres
Publié: (2026)

When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations
par: Bentert, Matthias, et autres
Publié: (2025)

Clustering under Constraints: Efficient Parameterized Approximation Schemes
par: Bhore, Sujoy, et autres
Publié: (2025)

Dimension-Free Parameterized Approximation Schemes for Hybrid Clustering
par: Gadekar, Ameet, et autres
Publié: (2025)

Packing Short Cycles
par: Bentert, Matthias, et autres
Publié: (2024)

Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints
par: Inamdar, Tanmay, et autres
Publié: (2024)

Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments
par: Gupta, Sushmita, et autres
Publié: (2024)

Fixed-Parameter Tractability of Hedge Cut
par: Fomin, Fedor V., et autres
Publié: (2024)

When does FTP become FPT?
par: Bentert, Matthias, et autres
Publié: (2025)

Fault-Tolerant Matroid Bases
par: Bentert, Matthias, et autres
Publié: (2025)

Stability in Graphs with Matroid Constraints
par: Fomin, Fedor V., et autres
Publié: (2024)

Fully Polynomial-time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication
par: Bentert, Matthias, et autres
Publié: (2024)

Path Contraction Faster than $2^n$
par: Agrawal, Akanksha, et autres
Publié: (2025)

Algorithms for Euclidean Distance Matrix Completion: Exploiting Proximity to Triviality
par: Fomin, Fedor V., et autres
Publié: (2026)

Planar Network Diversion
par: Bentert, Matthias, et autres
Publié: (2025)

When far is better: The Chamberlin-Courant approach to obnoxious committee selection
par: Gupta, Sushmita, et autres
Publié: (2024)

Parameterized Approximation for Capacitated $d$-Hitting Set with Hard Capacities
par: Lokshtanov, Daniel, et autres
Publié: (2024)

FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii
par: Bandyapadhyay, Sayan, et autres
Publié: (2023)

Perfect Network Resilience in Polynomial Time
par: Bentert, Matthias, et autres
Publié: (2026)

Finding sparse induced subgraphs on graphs of bounded induced matching treewidth
par: Bodlaender, Hans L., et autres
Publié: (2025)

A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset-FAST
par: Jana, Satyabrata, et autres
Publié: (2025)

Structural Optimal Jacobian Accumulation and Minimum Edge Count are NP-Complete Under Vertex Elimination
par: Bentert, Matthias, et autres
Publié: (2025)

Approximation Schemes for Planar Graph Connectivity Problems
par: Neuwohner, Meike, et autres
Publié: (2025)

The Bron-Kerbosch Algorithm with Vertex Ordering is Output-Sensitive
par: Manoussakis, George
Publié: (2019)

Algorithmic Extensions of Dirac's Theorem
par: Fomin, Fedor V., et autres
Publié: (2020)

Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems
par: Esmer, Barış Can, et autres
Publié: (2024)

Line Cover and Related Problems
par: Bentert, Matthias, et autres
Publié: (2025)

Distributed Model Checking on Graphs of Bounded Treedepth
par: Fomin, Fedor V., et autres
Publié: (2024)

New Oracles and Labeling Schemes for Vertex Cut Queries
par: Jiang, Yonggang, et autres
Publié: (2025)

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3
par: Lokshtanov, Daniel, et autres
Publié: (2024)

Minimum Envy Graphical House Allocation Beyond Identical Valuations
par: Inamdar, Tanmay, et autres
Publié: (2026)

A $(\frac32+\frac1{\mathrm{e}})$-Approximation Algorithm for Ordered TSP
par: Armbruster, Susanne, et autres
Publié: (2024)

The Structural Complexity Landscape of Finding Balance-Fair Shortest Paths
par: Bentert, Matthias, et autres
Publié: (2024)