Please use this identifier to cite or link to this item: https://doi.org/10.1016/S0020-0190(00)00033-8
Title: Approximating low-congestion routing and column-restricted packing problems
Authors: Baveja, A.
Srinivasan, A. 
Issue Date: 2000
Source: Baveja, A., Srinivasan, A. (2000). Approximating low-congestion routing and column-restricted packing problems. Information Processing Letters 74 (1) : 19-25. ScholarBank@NUS Repository. https://doi.org/10.1016/S0020-0190(00)00033-8
Abstract: The factorial and integral optima of column-sparse integer programs are proved to be `nearby'. This yields improved approximation algorithms for some generalizations of the knapsack problem, with applications to low-congestion routing in networks, file replication in distributed databases, and other packing problems.
Source Title: Information Processing Letters
URI: http://scholarbank.nus.edu.sg/handle/10635/39054
ISSN: 00200190
DOI: 10.1016/S0020-0190(00)00033-8
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

3
checked on Dec 7, 2017

WEB OF SCIENCETM
Citations

3
checked on Nov 23, 2017

Page view(s)

59
checked on Dec 11, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.