Sublinear algorithms for scheduling with chain precedence constraints

DOI10.1007/978-981-96-1090-7_4MaRDI QIDQ6970747zbMATH OpenFDO

Authors Bin Fu, Yumei Huo, Hairong Zhao

Publication date 17 June 2025

Full work available at URL https://doi.org/10.1007/978-981-96-1090-7_4

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• A dense hierarchy of sublinear time approximation schemes for bin packing
• A sublinear-time approximation scheme for bin packing
• Approximating Average Parameters of Graphs
• Data streams: algorithms and applications.
• scientific article; zbMATH DE number 1615273 (Why is no real title available?)
• On Sums of Independent Random Variables with Unbounded Variance and Estimating the Average Degree in a Graph
• Probabilistic counting algorithms for data base applications
• Scheduling chain-structured tasks to minimize makespan and mean flow time
• Scheduling identical jobs with chain precedence constraints on two uniform machines
• Scheduling with deadlines and loss functions
• Selection and sorting with limited storage
• Streaming algorithms for bin packing and vector scheduling
• Streaming algorithms for multitasking scheduling with shared processing
• Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity
• Sublinear Geometric Algorithms
• Sublinear time algorithms
• Sublinear time width-bounded separators and their application to the protein side-chain packing problem
• Sublinear-time Algorithms

This page was built for publication: Sublinear algorithms for scheduling with chain precedence constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970747)