Verified Approximation Algorithms (Q5049009)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7614677

Language	Label	Description	Also known as
English	Verified Approximation Algorithms	scientific article; zbMATH DE number 7614677

Statements

scholarly article

0 references

Verified Approximation Algorithms (English)

0 references

0 references

0 references

Simon Robillard

0 references

Automated Reasoning

0 references

publication date

9 November 2022

0 references

describes a project that uses

Archive Formal Proofs

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-51054-1_17

0 references

Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems

0 references

Cardinality of relations and relational approximation algorithms

0 references

Logic Based Program Synthesis and Transformation

0 references

A linear approximation algorithm for bin packing with absolute approximation factor \(\frac {3}{2}\)

0 references

Verifying an incremental theory solver for linear arithmetic in Isabelle/HOL

0 references

Greed is good: Approximating independent sets in sparse and bounded-degree graphs

0 references

Concrete Semantics

0 references

Identifiers

10.1007/978-3-030-51054-1_17

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5049009

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5049009&oldid=37455594"