2016 Help me understand this report
Strongly Fully Polynomial Time Approximation Scheme for the Weighted Completion Time Minimization Problem on Two-Parallel Capacitated Machines**This work has been supported by the Université de Lorraine (France) and the Universität des Saarlandes (Germany) during the year 2015.
Search citation statements
Paper Sections
Select...
Citation Types
0
0
0
Year Published
2020
2020
Publication Types
Select...
1
Relationship
0
1
Authors
Journals
Cited by 1 publication
References 15 publications
0
0
0
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
