scientific article; zbMATH DE number 3639145

zbMath0411.68040MaRDI QIDQ4198057

Giorgio Ausiello

Publication date: 1977

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

zbMATH Keywords

combinatoricscomputational complexityoptimization problemsknapsack problemtravelling salesman problemoperations researchapproximate algorithmsgraph colouring problemNp-complete problemspolynomially isomorphicschedule for independent tasks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Operations research and management science (90B99) Coloring of graphs and hypergraphs (05C15) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)

Related Items (2)

Non deterministic polynomial optimization problems and their approximations ⋮ Discrete extremal problems

This page was built for publication: