Complexity analysis and algorithms for the program download problem

DOI10.1007/S10878-013-9702-0MaRDI QIDQ2354307zbMATH OpenOpenAlexFDO

Authors Chao Peng, Jie Zhou, Binhai Zhu, Hong Zhu

Publication date 10 July 2015

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-013-9702-0

zbMATH Keywords

approximation algorithmFPT algorithmNP-completeprogram download problem

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• The program download problem: complexity and algorithms
• Broadcast scheduling, algorithms and complexity
• Optimal file distribution in peer-to-peer networks
• The complexity of scheduling TV commercials
• A simple but NP-hard problem of mixed-discrete programming and its solution by approximate algorithms

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• A simplified NP-complete satisfiability problem
• Network flows. Theory, algorithms, and applications.
• Optimal Data Retrieval Scheduling in the Multichannel Wireless Broadcast Environments

Cited in

(1)

• The program download problem: complexity and algorithms

This page was built for publication: Complexity analysis and algorithms for the program download problem

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