No label defined (Q5111717)

From MaRDI portal

Revision as of 18:30, 22 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article; zbMATH DE number 7205008

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7205008

Statements

scholarly article

0 references

0 references

Łukasz Kowalik

0 references

Arkadiusz Socała

0 references

publication date

27 May 2020

0 references

full work available at URL

https://arxiv.org/abs/1703.05559

0 references

zbMATH Keywords

TSP

0 references

treewidth

0 references

local search

0 references

XP algorithm

0 references

hardness in P

0 references

MaRDI profile type

MaRDI publication profile

0 references

Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

0 references

On exact algorithms for treewidth

0 references

New Results on the Old <i>k</i>-opt Algorithm for the Traveling Salesman Problem

0 references

Worst-case analysis of a new heuristic for the travelling salesman problem

0 references

A Method for Solving Traveling-Salesman Problems

0 references

Parameterized Algorithms

0 references

Improving TSP Tours Using Dynamic Programming over Tree Decompositions.

0 references

Fine-grained complexity analysis of two classic TSP variants

0 references

On two techniques of combining branching and treewidth

0 references

Pathwidth of cubic graphs and exact algorithms

0 references

Finding Induced Subgraphs via Minimal Triangulations

0 references

The parameterized complexity of local search for TSP, more refined

0 references

A Dynamic Programming Approach to Sequencing Problems

0 references

An effective implementation of the Lin-Kernighan traveling salesman heuristic

0 references

How easy is local search?

0 references

Dynamic programming meets the principle of inclusion and exclusion

0 references

Treewidth. Computations and approximations

0 references

On Finding and Verifying Locally Optimal Solutions

0 references

Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic

0 references

An Effective Heuristic Algorithm for the Traveling-Salesman Problem

0 references

Computer Solutions of the Traveling Salesman Problem

0 references

Smoothed Analysis of the 2-Opt Heuristic for the TSP: Polynomial Bounds for Gaussian Noise

0 references

Searching the \(k\)-change neighborhood for TSP is W[1]-hard

0 references

A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems

0 references

Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs

0 references

Subcubic Equivalences Between Path, Matrix, and Triangle Problems

0 references

Identifiers

zbMATH Open document ID

0 references

10.4230/LIPIcs.ESA.2017.30

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5111717

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5111717&oldid=36588595"