A quadratic-order problem kernel for the traveling salesman problem parameterized by the vertex cover number

07/18/2022
by   René van Bevern, et al.
0

The NP-hard graphical traveling salesman problem (GTSP) is to find a closed walk of total minimum weight that visits (at least once) each vertex in an undirected edge-weighted and not necessarily complete graph. Recently, Blažej et al. [ESA 2022] showed a problem kernel with O(τ^3) vertices for GTSP, where τ is the vertex cover number of the input graph. We present a problem kernel with only O(τ^2) vertices.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/08/2018

An O^*(2.619^k) algorithm for 4-path vertex cover

In the 4-path vertex cover problem, the input is an undirected graph G a...
research
11/13/2022

Kernelization for Partial Vertex Cover via (Additive) Expansion Lemma

Given a graph and two integers k and ℓ, Partial Vertex Cover asks for a ...
research
11/28/2013

Solving Minimum Vertex Cover Problem Using Learning Automata

Minimum vertex cover problem is an NP-Hard problem with the aim of findi...
research
05/31/2018

A Parameterized Complexity View on Collapsing k-Cores

We study the NP-hard graph problem Collapsed k-Core where, given an undi...
research
06/02/2023

Parameterized Complexity of Broadcasting in Graphs

The task of the broadcast problem is, given a graph G and a source verte...
research
03/24/2020

Parameterized Algorithms for Red-Blue Weighted Vertex Cover on Trees

Weighted Vertex Cover is a variation of an extensively studied NP-comple...
research
02/28/2023

Parameterized Complexity of Vertex Splitting to Pathwidth at most 1

Motivated by the planarization of 2-layered straight-line drawings, we c...

Please sign up or login with your details

Forgot password? Click here to reset