Código QR (código de barras bidimensional)

Verified Approximation Algorithms

We present the first formal verification of approximation algorithms for NP-complete optimization problems: vertex cover, independent set, set cover, center selection, load balancing, and bin packing. We uncover incompletenesses in existing proofs and improve the approximation ratio in one case. All...

תיאור מלא

שמור ב:
Principais autores: Robin Eßmann, Tobias Nipkow, Simon Robillard, Ujkan Sulejmani
פורמט: Artigo
שפה:Inglês
יצא לאור: Logical Methods in Computer Science e.V. 2022-03-01
סדרה:Logical Methods in Computer Science
נושאים:
computer science - logic in computer science
computer science - data structures and algorithms
גישה מקוונת:https://lmcs.episciences.org/7416/pdf
תגים: הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!

פריטים דומים