Matroidal Approximations of Independence Systems

06/14/2019
by   Sven de Vries, et al.
0

Milgrom (2017) has proposed a heuristic for determining a maximum weight basis of an independence system I given that for sets from O ⊆ I we care in particular about the qualitiy of approximation as we assume, that O contains (frequently) the optimal basis. It is based on finding an `inner matroid', one contained in the independence system. We show that without additional assumptions on O being different from I the worst-case performance of this new heuristic is no better than that of the classical greedy algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/11/2022

Asymptotic Optimality of the Greedy Patching Heuristic for Max TSP in Doubling Metrics

The maximum traveling salesman problem (Max TSP) consists of finding a H...
research
09/22/2020

On the number of contingency tables and the independence heuristic

We obtain sharp asymptotic estimates on the number of n × n contingency ...
research
11/12/2022

Formalizing the presumption of independence

Mathematical proof aims to deliver confident conclusions, but a very sim...
research
02/22/2023

Approximation Ineffectiveness of a Tour-Untangling Heuristic

We analyze a tour-uncrossing heuristic for the Travelling Salesperson Pr...
research
01/30/2018

A Rational Distributed Process-level Account of Independence Judgment

It is inconceivable how chaotic the world would look to humans, faced wi...
research
01/15/2020

Optimal rates for independence testing via U-statistic permutation tests

We study the problem of independence testing given independent and ident...
research
06/01/2015

Desirability and the birth of incomplete preferences

We establish an equivalence between two seemingly different theories: on...

Please sign up or login with your details

Forgot password? Click here to reset