A New Lower Bound for the Set-Partitioning Problem

DOI10.1137/0217040zbMath0651.68089OpenAlexW2041757628MaRDI QIDQ3796782

John Welliaveetil John

Publication date: 1988

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

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

zbMATH Keywords

lower bounddecision treeanalysis of algorithmset-partitioning

Mathematics Subject Classification ID

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

Related Items

Selection problems via \(m\)-ary queries ⋮ Select with Groups of 3 or 4 ⋮ Finding the \(\alpha n\)-th largest element ⋮ Unnamed Item ⋮ A selectable sloppy heap ⋮ Selection Algorithms with Small Groups

This page was built for publication: A New Lower Bound for the Set-Partitioning Problem