Verified Approximation Algorithms

04/28/2021
by   Robin Eßmann, et al.
0

We present the first formal verification of approximation algorithms for NP-complete optimization problems: vertex cover, independent set, set cover, load balancing, and bin packing. We uncover incompletenesses in existing proofs and improve the approximation ratio in one case.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

12/18/2017

Approximation algorithms for stochastic and risk-averse optimization

We present improved approximation algorithms in stochastic optimization....
11/15/2021

A Chronology of Set Cover Inapproximability Results

It is well-known that an algorithm exists which approximates the NP-comp...
10/29/2021

Classifying Approximation Algorithms: Understanding the APX Complexity Class

We are interested in the intersection of approximation algorithms and co...
10/12/2012

Inferring the Underlying Structure of Information Cascades

In social networks, information and influence diffuse among users as cas...
05/27/2020

Distributed algorithms for covering, packing and maximum weighted matching

This paper gives poly-logarithmic-round, distributed D-approximation alg...
07/06/2017

When the Optimum is also Blind: a New Perspective on Universal Optimization

Consider the following variant of the set cover problem. We are given a ...
09/26/2019

Approximation Algorithms for Process Systems Engineering

Designing and analyzing algorithms with provable performance guarantees ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.