RESOURCE MANAGEMENT AND ALLOCATION IN COMPUTER AND COMMUNICATION NETWORKS

Gong, Zhigang
2003-05-22
Thumbnail Image

View/Download File

03-024.pdf (680.06 KB)

Persistent link to this item

https://hdl.handle.net/11299/215567
Statistics
View Statistics

Journal Title

Journal ISSN

Volume Title

Title

RESOURCE MANAGEMENT AND ALLOCATION IN COMPUTER AND COMMUNICATION NETWORKS

Authors

Published Date

2003-05-22

Publisher

Type

Report

Abstract

This thesis focuses on the design and application of approximation algorithms in computer and communication systems. Many problems in these computer and communication systems are known as NP-hard in combinatorial computation complexity theory. Several of them can be solved approximately using a common approximation theory approach: the combination of greedy, linear programming and randomization. We first extended the known approximation techniques and then applied the technique to several chosen problems.

Keywords

Description

Related to

Replaces

License

Collections

Computer Science & Engineering (CS&E) Technical Reports

Series/Report Number

Technical Report; 03-024

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Suggested citation

Gong, Zhigang. (2003). RESOURCE MANAGEMENT AND ALLOCATION IN COMPUTER AND COMMUNICATION NETWORKS. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215567.

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.