Image de couverture de livre

Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Lill, Jonas, Petrova, Kalina, Weber, Simon
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Computational Complexity Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

U-Bubble Model for Mixed Unit Interval Graphs and its Applications: The MaxCut Problem Revisited
par: Kratochvíl, Jan, et autres
Publié: (2020)

Multi-Pass Streaming Lower Bounds for Approximating Max-Cut
par: Fei, Yumou, et autres
Publié: (2025)

Lower Bounds for Linear Operators
par: Ko, Young Kun
Publié: (2025)

Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover
par: Foucaud, Florent, et autres
Publié: (2023)

Dichotomies for Maximum Matching Cut: $H$-Freeness, Bounded Diameter, Bounded Radius
par: Lucke, Felicia, et autres
Publié: (2023)

Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs
par: Johnson, Matthew, et autres
Publié: (2022)

Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs
par: Lucke, Felicia, et autres
Publié: (2024)

Parameterized Complexity of Streaming Diameter and Connectivity Problems
par: Oostveen, Jelle J., et autres
Publié: (2022)

The Parameterized Complexity of Vertex-Coloring Edge-Weighting
par: Aute, Shubhada, et autres
Publié: (2026)

Metric Dimension and Geodetic Set Parameterized by Vertex Cover
par: Foucaud, Florent, et autres
Publié: (2024)

Finding Minimum Distance Preservers: A Parameterized Study
par: Simonov, Kirill, et autres
Publié: (2026)

Combinatorial Parameterized Algorithms for Chemical Descriptors based on Molecular Graph Sparsity
par: Conrado, Giovanna K., et autres
Publié: (2023)

Asymptotically Optimal Inapproximability of Maxmin $k$-Cut Reconfiguration
par: Hirahara, Shuichi, et autres
Publié: (2024)

The Parameterized Complexity of Independent Set and More when Excluding a Half-Graph, Co-Matching, or Matching
par: Dreier, Jan, et autres
Publié: (2026)

(Independent) Roman Domination Parameterized by Distance to Cluster
par: Ashok, Pradeesha, et autres
Publié: (2024)

On the Parameterized Complexity of Grundy Domination and Zero Forcing Problems
par: Scheffler, Robert
Publié: (2025)

Fractional Linear Matroid Matching is in quasi-NC
par: Gurjar, Rohit, et autres
Publié: (2024)

Parameterized Complexity of (d,r)-Domination via Modular Decomposition
par: Cordasco, Gennaro, et autres
Publié: (2024)

$O(n +f(k))$: Truly Linear FPT
par: Bumpus, Benjamin Merlin, et autres
Publié: (2026)

Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover
par: Chakraborty, Dipayan, et autres
Publié: (2024)

Finding $d$-Cuts in Probe $H$-Free Graphs
par: Dabrowski, Konrad K., et autres
Publié: (2025)

Polynomial-Time Pseudodeterministic Construction of Primes
par: Chen, Lijie, et autres
Publié: (2023)

A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees
par: Shao, Shuai, et autres
Publié: (2023)

Solving NP-hard Problems on \textsc{GaTEx} Graphs: Linear-Time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets
par: Hellmuth, Marc, et autres
Publié: (2023)

Optimal PSPACE-hardness of Approximating Set Cover Reconfiguration
par: Hirahara, Shuichi, et autres
Publié: (2024)

Counting Locally Optimal Tours in the TSP
par: Manthey, Bodo, et autres
Publié: (2024)

Relative-error monotonicity testing
par: Chen, Xi, et autres
Publié: (2024)

The Days On Days Off Scheduling Problem
par: Nießen, Fabien, et autres
Publié: (2024)

Channel allocation revisited through 1-extendability of graphs
par: Busson, Anthony, et autres
Publié: (2024)

The complexity of strong conflict-free vertex-connection $k$-colorability
par: Hsieh, Sun-Yuan, et autres
Publié: (2024)

Alphabet Reduction for Reconfiguration Problems
par: Ohsaka, Naoto
Publié: (2024)

A Dichotomy for Maximum PCSPs on Graphs
par: Nakajima, Tamio-Vesa, et autres
Publié: (2024)

On the tractability and approximability of non-submodular cardinality-based $s$-$t$ cut problems in hypergraphs
par: Bengali, Vedangi, et autres
Publié: (2024)

Tight Inapproximability of Target Set Reconfiguration
par: Ohsaka, Naoto
Publié: (2024)

The periodic structure of local consistency
par: Ciardo, Lorenzo, et autres
Publié: (2024)

Recognizing Sumsets is NP-Complete
par: Abboud, Amir, et autres
Publié: (2024)

A note on approximating the average degree of bounded arboricity graphs
par: Eden, Talya, et autres
Publié: (2026)

Relative-error unateness testing
par: Chen, Xi, et autres
Publié: (2025)

Refining the Complexity Landscape of Speed Scaling: Hardness and Algorithms
par: Antoniadis, Antonios, et autres
Publié: (2025)

Parameterised distance to local irregularity
par: Fioravantes, Foivos, et autres
Publié: (2023)