Approximate sequencing for variable length tasks.

DOI10.1016/S0304-3975(02)00091-9zbMath1051.68030OpenAlexW2019921368MaRDI QIDQ1401212

Xiaotie Deng, Lusheng Wang, Mao-cheng Cai

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00091-9

zbMATH Keywords

variable length sequencing problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10)

Related Items (2)

Approximate and dynamic rank aggregation ⋮ On polynomial-time approximation algorithms for the variable length scheduling problem.

Cites Work

• Unnamed Item
• Unnamed Item
• Exploring an unknown graph
• Exploring Unknown Environments

This page was built for publication: Approximate sequencing for variable length tasks.