scientific article

zbMath0469.68054MaRDI QIDQ3923600

Marco Protasi, Alberto Marchetti-Spaccamela, Giorgio Ausiello

Publication date: 1981

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

NP-completenessknapsack problemrandom graphgreedy algorithmsapproximate algorithmsclique problemblind algorithmshort-sighted algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Mathematical programming (90C99)

Related Items

The largest tree in a random graph