DeepAI AI Chat
Log In Sign Up

Matroidal Approximations of Independence Systems

by   Sven de Vries, et al.
Universität Trier
University of Pennsylvania

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.


page 1

page 2

page 3

page 4


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...

On the number of contingency tables and the independence heuristic

We obtain sharp asymptotic estimates on the number of n × n contingency ...

Formalizing the presumption of independence

Mathematical proof aims to deliver confident conclusions, but a very sim...

Approximation Ineffectiveness of a Tour-Untangling Heuristic

We analyze a tour-uncrossing heuristic for the Travelling Salesperson Pr...

A Rational Distributed Process-level Account of Independence Judgment

It is inconceivable how chaotic the world would look to humans, faced wi...

Optimal rates for independence testing via U-statistic permutation tests

We study the problem of independence testing given independent and ident...

A conditional independence test for causality in econometrics

The Y-test is a useful tool for detecting missing confounders in the con...