High-performance approximation algorithms for information-flow control problems on networks

点击翻译按钮获取中文摘要

Problems arising from information-flow control on networks like the Internet include finding routing paths and scheduling packets at nodes. Thus, they are hard to solve efficiently, and in most practical applications, approximate solutions with performance guarantee are often used. In this project, surveying researches on high performance approximation algorithms for problems arising on networks, we proposed algorithms based on mathematical programming formulation, and included obtained results in books which were published in representative publishers in Japan.