Mingyang Gong

From MaRDI portal
Person:2168773

Available identifiers

zbMath Open gong.mingyangMaRDI QIDQ2168773

List of research outcomes





PublicationDate of PublicationType
Approximation algorithms for the longest run subsequence problem2024-10-21Paper
An approximation algorithm for covering vertices by \(4^+\)-paths2024-09-16Paper
Approximation algorithms for covering vertices by long paths2024-08-13Paper
Approximation algorithms for covering vertices by long paths2024-08-06Paper
A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops2024-05-30Paper
Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time2024-04-24Paper
Improved approximation algorithms for multiprocessor scheduling with testing2023-08-10Paper
Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing2022-08-26Paper

Research outcomes over time

This page was built for person: Mingyang Gong

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:2168773&oldid=6638003"
Powered by MediaWiki