Constant time approximation scheme for largest well predicted subset

DOI10.1007/s10878-010-9371-1zbMath1271.90069OpenAlexW2027636550MaRDI QIDQ2377379

Lusheng Wang, Bin Fu

Publication date: 28 June 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-010-9371-1

zbMATH Keywords

randomizationapproximation schemeconstant time

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Uses Software

• MaxSub

Cites Work

• On the closest string and substring problems
• Finding Largest Well-Predicted Subset of Protein Structure Models
• Combinatorial Pattern Matching
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Constant time approximation scheme for largest well predicted subset