
An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in dClaw Free Graphs
In this paper, we consider the task of computing an independent set of m...
read it

Optimal Algorithm for the Planar TwoCenter Problem
In this paper, we consider the planar twocenter problem: Given a set S ...
read it

Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number
We investigate the locality number, a recently introduced structural par...
read it

A LinearTime Approximation Algorithm for the Orthogonal Terrain Guarding Problem
In this paper, we consider the 1.5dimensional orthogonal terrain guardi...
read it

APXHardness and Approximation for the kBurning Number Problem
Consider an information diffusion process on a graph G that starts with ...
read it

Quantum impossible differential and truncated differential cryptanalysis
We study applications of BV algorithm and present quantum versions of im...
read it

4uniform BCT permutations from generalized butterfly structure
As a generalization of Dillon's APN permutation, butterfly structure and...
read it
A 3/4 Differential Approximation Algorithm for Traveling Salesman Problem
In this paper, we consider differential approximability of the traveling salesman problem (TSP). We show that TSP is 3/4differential approximable, which improves the currently best known bound 3/4 O(1/n) due to Escoffier and Monnot in 2008, where n denotes the number of vertices in the given graph.
READ FULL TEXT
Comments
There are no comments yet.