Titlebook: Combinatorial Optimization and Applications; 7th International Co Peter Widmayer,Yinfeng Xu,Binhai Zhu Conference proceedings 2013 Springer

随意

用树皮

跳动

柱廊

华而不实

Online Scheduling on Two Parallel Machines with Release Times and Delivery Times

支柱

Parallel Machine Scheduling with a Single Server: Loading and Unloading

amplitude

Prompt Mechanism for Online Auctions with Multi-unit Demands

Offensive

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