Approximations and Hardness in Covering Partially Ordered Items

로그인

통찰 - Approximations and Hardness in Covering Partially Ordered Items

Approximations and Hardness of Covering and Packing Partially Ordered Items

Ein 2-Approximationsalgorithmus für das Problem der teilweise geordneten Elemente auf Ausbäumen.

1

소개

제품 | 리소스

통찰

© 2024 by Linnk AI