Viresh Patel

activity

20102022

most citedDeterministic polynomial-time approximation algorithms for partition functions and graph polynomials

115 citations · 203 across the 24 of their papers we have counts for

collaborators

Showing 2014 · cs.DSShow all

2 papers · 2 filters

cs.DS2014

Parameterized TSP: Beating the Average

Gregory Gutin, Viresh Patel

In the Travelling Salesman Problem (TSP), we are given a complete graph $K_{n}$ together with an integer weighting $w$ on the edges of $K_{n}$ , and we are asked to find a Hamilton cycl…

cs.DS2014

A domination algorithm for ${0, 1}$ -instances of the travelling salesman problem

Daniela Kühn, Deryk Osthus, Viresh Patel

We present an approximation algorithm for ${0, 1}$ -instances of the travelling salesman problem which performs well with respect to combinatorial dominance. More precisely, we giv…

Parameterized TSP: Beating the Average

A domination algorithm for {0,1}-instances of the travelling salesman problem

A domination algorithm for ${0, 1}$ -instances of the travelling salesman problem