Embedding complexity and discrete optimization. I: A new divide and conquer approach to discrete optimization

DOI10.1007/S000260200002zbMATH Open1023.90051OpenAlexW1988470180MaRDI QIDQ1400780FDOQ1400780

Authors: Dietmar Cieslik, Andreas W. M. Dress, Katharina T. Huber, Vincent Moulton 

Publication date: 14 August 2003

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s000260200002

Recommendations

• Embedding complexity and discrete optimization. II: A dynamical programming approach to the Steiner-tree problem
• Publication:4890614
• scientific article; zbMATH DE number 1552036
• scientific article; zbMATH DE number 1696626
• Divide-and-conquer approximation algorithms via spreading metrics

zbMATH Keywords

optimizationcomputational complexitylinear programmingdynamic programmingtreewidthILPinteger linear programmingdiscrete optimizationalgorithmic complexityLPBoltzmann statistics for discrete optimization problemsdivide and qonquerdynamic-programming schemesembedding complexity

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (3)

• Steiner's problem in double trees
• Embedding complexity and discrete optimization. II: A dynamical programming approach to the Steiner-tree problem
• Connectivity calculus

This page was built for publication: Embedding complexity and discrete optimization. I: A new divide and conquer approach to discrete optimization

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