Robust independence systems

Naonori Kakimura, Kazuhisa Makino

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

An independence system F is one of the most fundamental combinatorial concepts, which includes a variety of objects in graphs and hypergraphs such as matchings, stable sets, and matroids. We discuss the robustness for independence systems, which is a natural generalization of the greedy property of matroids. For a real number α > 0, a set X ∈ F is said to be α-robust if for any k, it includes an α-approximation of the maximum k-independent set, where a set Y in F is called k-independent if the size |Y

Original languageEnglish
Pages (from-to)1257-1273
Number of pages17
JournalSIAM Journal on Discrete Mathematics
Volume27
Issue number3
DOIs
Publication statusPublished - 2013
Externally publishedYes

Fingerprint

Independence System
Matroid
Stable Set
Independent Set
Hypergraph
Robustness
Approximation
Graph in graph theory

Keywords

  • Exchangeability
  • Independence systems
  • Matroids
  • Robustness

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Robust independence systems. / Kakimura, Naonori; Makino, Kazuhisa.

In: SIAM Journal on Discrete Mathematics, Vol. 27, No. 3, 2013, p. 1257-1273.

Research output: Contribution to journalArticle

Kakimura, Naonori ; Makino, Kazuhisa. / Robust independence systems. In: SIAM Journal on Discrete Mathematics. 2013 ; Vol. 27, No. 3. pp. 1257-1273.
@article{20e3c525a5ef4fbf97a901e53292cc2d,
title = "Robust independence systems",
abstract = "An independence system F is one of the most fundamental combinatorial concepts, which includes a variety of objects in graphs and hypergraphs such as matchings, stable sets, and matroids. We discuss the robustness for independence systems, which is a natural generalization of the greedy property of matroids. For a real number α > 0, a set X ∈ F is said to be α-robust if for any k, it includes an α-approximation of the maximum k-independent set, where a set Y in F is called k-independent if the size |Y",
keywords = "Exchangeability, Independence systems, Matroids, Robustness",
author = "Naonori Kakimura and Kazuhisa Makino",
year = "2013",
doi = "10.1137/120899480",
language = "English",
volume = "27",
pages = "1257--1273",
journal = "SIAM Journal on Discrete Mathematics",
issn = "0895-4801",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "3",

}

TY - JOUR

T1 - Robust independence systems

AU - Kakimura, Naonori

AU - Makino, Kazuhisa

PY - 2013

Y1 - 2013

N2 - An independence system F is one of the most fundamental combinatorial concepts, which includes a variety of objects in graphs and hypergraphs such as matchings, stable sets, and matroids. We discuss the robustness for independence systems, which is a natural generalization of the greedy property of matroids. For a real number α > 0, a set X ∈ F is said to be α-robust if for any k, it includes an α-approximation of the maximum k-independent set, where a set Y in F is called k-independent if the size |Y

AB - An independence system F is one of the most fundamental combinatorial concepts, which includes a variety of objects in graphs and hypergraphs such as matchings, stable sets, and matroids. We discuss the robustness for independence systems, which is a natural generalization of the greedy property of matroids. For a real number α > 0, a set X ∈ F is said to be α-robust if for any k, it includes an α-approximation of the maximum k-independent set, where a set Y in F is called k-independent if the size |Y

KW - Exchangeability

KW - Independence systems

KW - Matroids

KW - Robustness

UR - http://www.scopus.com/inward/record.url?scp=84887936554&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84887936554&partnerID=8YFLogxK

U2 - 10.1137/120899480

DO - 10.1137/120899480

M3 - Article

AN - SCOPUS:84887936554

VL - 27

SP - 1257

EP - 1273

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

SN - 0895-4801

IS - 3

ER -