Výsledky vyhledávání

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Report

A $(1.4 + \epsilon)$-approximation algorithm for the $2$-Max-Duo problem

Autor: Xu, Yao, Chen, Yong, Lin, Guohui, Liu, Tian, Luo, Taibo, Zhang, Peng

The maximum duo-preservation string mapping (Max-Duo) problem is the complement of the well studied minimum common string partition (MCSP) problem, both of which have applications in many fields including text compression and bioinformatics. $k$-Max-

Externí odkaz: http://arxiv.org/abs/1702.06256

Zobrazit plný text záznamu

Report

A local search 2.917-approximation algorithm for duo-preservation string mapping

Autor: Xu, Yao, Chen, Yong, Luo, Taibo, Lin, Guohui

We study the {\em maximum duo-preservation string mapping} ({\sc Max-Duo}) problem, which is the complement of the well studied {\em minimum common string partition} ({\sc MCSP}) problem. Both problems have applications in many fields including text

Externí odkaz: http://arxiv.org/abs/1702.01877

Zobrazit plný text záznamu

Report

On rescheduling due to machine disruption while to minimize the total weighted completion time

Autor: Luo, Wenchang, Luo, Taibo, Goebel, Randy, Lin, Guohui

We investigate a single machine rescheduling problem that arises from an unexpected machine unavailability, after the given set of jobs has already been scheduled to minimize the total weighted completion time. Such a disruption is represented as an

Externí odkaz: http://arxiv.org/abs/1701.07498

Zobrazit plný text záznamu