CNR Institutional Research Information System

An outline of combinatorial optimization problems from the NP- completeness theory point of view is worked out. The importance of approximation algorithms is also stressed, and some results concerning the performance evaluation function, bin packing, and network flow equilibrium problems are presented.

Computational complexity: the problem of approximation

Aiello A;Furnari M;Massarotti A;Ventriglia F
1986

Abstract

An outline of combinatorial optimization problems from the NP- completeness theory point of view is worked out. The importance of approximation algorithms is also stressed, and some results concerning the performance evaluation function, bin packing, and network flow equilibrium problems are presented.
1986
Istituto di Scienze Applicate e Sistemi Intelligenti "Eduardo Caianiello" - ISASI
Inglese
János Demetrovics, George Katona, Arto Salomaa
Algebra, combinatorics and logic in computer science, Colloq. Math. Soc. János Bolyai
Algebra, combinatorics and logic in computer science
51
62
12
Sì, ma tipo non specificato
September 12-16, 1983
Györ/Hungary
combinatorial optimization; NP-completeness; approximation algorithms; performance evaluation; bin packing; network flow equilibrium problems
4
none
Aiello, A.; Burattini, E.; Furnari, M.; Massarotti, A.; Ventriglia, F.
273
info:eu-repo/semantics/conferenceObject
04 Contributo in convegno::04.01 Contributo in Atti di convegno
04.01 Contributo in Atti di convegno
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/309109
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact