Finding Augmented-Set Bases

DOI10.1137/0211051zbMath0486.68036OpenAlexW2000796100MaRDI QIDQ3947120

Virgil Gligor, David Maier

Publication date: 1982

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0211051

zbMATH Keywords

NP-complete problemspolynomial-time approximation algorithmsdeletion problemsaugmentation problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Related Items (2)

A weighted min-max relation for intervals ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems)

This page was built for publication: Finding Augmented-Set Bases