随意
发表于 2025-3-30 10:57:58
http://reply.papertrans.cn/23/2300/229979/229979_51.png
用树皮
发表于 2025-3-30 12:33:47
http://reply.papertrans.cn/23/2300/229979/229979_52.png
跳动
发表于 2025-3-30 20:01:34
http://reply.papertrans.cn/23/2300/229979/229979_53.png
柱廊
发表于 2025-3-31 00:34:09
http://reply.papertrans.cn/23/2300/229979/229979_54.png
华而不实
发表于 2025-3-31 03:14:14
Online Scheduling on Two Parallel Machines with Release Times and Delivery Times
支柱
发表于 2025-3-31 07:18:56
Parallel Machine Scheduling with a Single Server: Loading and Unloading
amplitude
发表于 2025-3-31 12:36:35
Prompt Mechanism for Online Auctions with Multi-unit Demands
Offensive
发表于 2025-3-31 14:55:19
Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings |.| is no less than a given number .. The algorithm runs in . time, where . (respectively, .) is the number of vertices (respectively, edges) in .. We then present a combinatorial approximation algorithm for the NP-hard problem of finding two disjoint matchings in a given edge-weighted graph . so t