A greedy algorithm for interval greedoids

被引：3

作者：

Mao, Hua ^{[1
]}

机构：

[1] Hebei Univ, Dept Math, Baoding 071002, Peoples R China

来源：

OPEN MATHEMATICS | 2018年 / 16卷

关键词：

Interval greedoid; Exchangeable system; Greedy algorithm; Positive weight;

D O I：

10.1515/math-2018-0026

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We show that the greedy algorithm provided in this paperworks for interval greedoids with positive weights under some conditions, and also characterize an exchangeable systemto be an interval greedoid with the assistance of the greedy algorithm.

引用

页码：260 / 267

页数：8

共 6 条

[1] [Anonymous], 1991, Greedoids
[2] Bjorner A., 1992, ENCY MATH ITS APPL, P284
[3] AN EXACT CHARACTERIZATION OF GREEDY STRUCTURES
HELMAN, P
MORET, BME
SHAPIRO, HD
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 1993, 6 (02) : 274 - 283
[4] Korte BH., 2011, COMBINATORIAL OPTIMI
[5] On local maximum stable set greedoids
Levit, Vadim E.
Mandrescu, Eugen
[J]. DISCRETE MATHEMATICS, 2012, 312 (03) : 588 - 596
[6] Oriented Interval Greedoids
Saliola, Franco
Thomas, Hugh
[J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2012, 47 (01) : 64 - 105

← 1 →