Automated proofs of upper bounds on the running time of splitting algorithms

DOI10.1007/978-3-540-28639-4_22MaRDI QIDQ5311517zbMATH OpenOpenAlexFDO

Authors S. S. Fedin, Alexander S. Kulikov

Publication date 23 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 2187722
• scientific article; zbMATH DE number 4164836
• Algorithmic approach to the split problems
• On the computational complexity of optimal multisplitting
• On the complexity of optimal multisplitting
• Automated recurrence analysis for almost-linear expected-runtime bounds
• scientific article; zbMATH DE number 954657
• scientific article; zbMATH DE number 4218375
• On the complexity of cutting-plane proofs using split cuts
• scientific article; zbMATH DE number 65752

Cited in

(5)

• A new upper bound for \(( n , 3)\)-MAX-SAT
• Automated recurrence analysis for almost-linear expected-runtime bounds
• scientific article; zbMATH DE number 2187722 (Why is no real title available?)
• Automated generation of simplification rules for SAT and MAXSAT
• Generating Faster Algorithms for d-Path Vertex Cover

This page was built for publication: Automated proofs of upper bounds on the running time of splitting algorithms

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