Approximation algorithms for NMR spectral peak assignment.
From MaRDI portal
Recommendations
Cites work
- A \(d/2\) approximation for maximum weight independent set in \(d\)-claw free graphs
- A unified approach to approximating resource allocation and scheduling
- scientific article; zbMATH DE number 3889282 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 1305405 (Why is no real title available?)
- scientific article; zbMATH DE number 910871 (Why is no real title available?)
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- Optimization, approximation, and complexity classes
Cited in
(5)- An approximation algorithm for a bottleneck traveling salesman problem
- Improved approximation algorithms for NMR spectral peak assignment
- Research in Computational Molecular Biology
- More reliable protein NMR peak assignment via improved 2-interval scheduling
- Fixed interval scheduling: models, applications, computational complexity and algorithms
This page was built for publication: Approximation algorithms for NMR spectral peak assignment.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1874392)