scientific article; zbMATH DE number 3913665

MaRDI QIDQ3690207zbMATH OpenFDO

Authors Hans-Georg Carstens, Peter Paeppinghaus

Publication date 1984

zbMATH Keywords

approximation of infinite problems by finite problemsextensibility of algorithmsinteger programmingmatchingmax-flowpartial recursive functionsperformance of algorithmstime table

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Algorithms in computer science (68W99)

Recommendations

• Approximation algorithms for extensible bin packing
• A polynomial algorithm for the extendability problem in bipartite graphs
• Approximation algorithms for extensible bin packing
• scientific article; zbMATH DE number 1953187
• Faster scaling algorithms for general graph matching problems

Cited in

(1)

• The Mapmaker's dilemma

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3690207)