
An Improved Approximation Algorithm for the Matching Augmentation Problem
We present a 5/3approximation algorithm for the matching augmentation p...
read it

An Improved Approximation Algorithm for the Minimum kEdge Connected MultiSubgraph Problem
We give a randomized 1+√(8ln k/k)approximation algorithm for the minimu...
read it

Parameterized inapproximability of Morse matching
We study the problem of minimizing the number of critical simplices from...
read it

Art Gallery Plus Single Specularreflection
Given a simple polygon P, in the Art Gallery problem, the goal is to fin...
read it

Partitioning Vectors into Quadruples: WorstCase Analysis of a MatchingBased Algorithm
Consider a problem where 4k given vectors need to be partitioned into k ...
read it

A Simple PrimalDual Approximation Algorithm for 2EdgeConnected Spanning Subgraphs
We propose a very simple and natural approximation algorithm for the pro...
read it

A General Approach to Approximate Multistage Subgraph Problems
In a Subgraph Problem we are given some graph and want to find a feasibl...
read it
The Matching Augmentation Problem: A 7/4Approximation Algorithm
We present a 7/4 approximation algorithm for the matching augmentation problem (MAP): given a multigraph with edges of cost either zero or one such that the edges of cost zero form a matching, find a 2edge connected spanning subgraph (2ECSS) of minimum cost. We first present a reduction of any given MAP instance to a collection of wellstructured MAP instances such that the approximation guarantee is preserved. Then we present a 7/4 approximation algorithm for a wellstructured MAP instance. The algorithm starts with a mincost 2edge cover and then applies earaugmentation steps. We analyze the cost of the earaugmentations using an approach similar to the one proposed by Vempala and Vetta for the (unweighted) minsize 2ECSS problem (`Factor 4/3 approximations for minimum 2connected subgraphs,' APPROX 2000, LNCS 1913, pp.262273).
READ FULL TEXT
Comments
There are no comments yet.