A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria

SIAM Journal on Computing

Saved in:

Bibliographic Details
Main Authors:	Srinivasan, A., Chung-Piaw, T.
Other Authors:	DECISION SCIENCES
Format:	Article
Published:	2013
Subjects:	Approximation algorithms Covering integer programs Discrete ham-sandwich theorems Linear programming Multicommodity flow Packet routing Randomized algorithms Randomized rounding Rounding theorems
Online Access:	http://scholarbank.nus.edu.sg/handle/10635/44984
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	National University of Singapore

id	sg-nus-scholar.10635-44984
record_format	dspace
spelling	sg-nus-scholar.10635-449842024-11-10T21:08:17Z A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria Srinivasan, A. Chung-Piaw, T. DECISION SCIENCES Approximation algorithms Covering integer programs Discrete ham-sandwich theorems Linear programming Multicommodity flow Packet routing Randomized algorithms Randomized rounding Rounding theorems SIAM Journal on Computing 30 6 2051-2068 SMJCA 2013-10-10T04:39:22Z 2013-10-10T04:39:22Z 2000 Article Srinivasan, A.,Chung-Piaw, T. (2000). A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria. SIAM Journal on Computing 30 (6) : 2051-2068. ScholarBank@NUS Repository. 00975397 http://scholarbank.nus.edu.sg/handle/10635/44984 NOT_IN_WOS Scopus
institution	National University of Singapore
building	NUS Library
continent	Asia
country	Singapore Singapore
content_provider	NUS Library
collection	ScholarBank@NUS
topic	Approximation algorithms Covering integer programs Discrete ham-sandwich theorems Linear programming Multicommodity flow Packet routing Randomized algorithms Randomized rounding Rounding theorems
spellingShingle	Approximation algorithms Covering integer programs Discrete ham-sandwich theorems Linear programming Multicommodity flow Packet routing Randomized algorithms Randomized rounding Rounding theorems Srinivasan, A. Chung-Piaw, T. A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria
description	SIAM Journal on Computing
author2	DECISION SCIENCES
author_facet	DECISION SCIENCES Srinivasan, A. Chung-Piaw, T.
format	Article
author	Srinivasan, A. Chung-Piaw, T.
author_sort	Srinivasan, A.
title	A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria
title_short	A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria
title_full	A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria
title_fullStr	A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria
title_full_unstemmed	A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria
title_sort	constant-factor approximation algorithm for packet routing and balancing local vs. global criteria
publishDate	2013
url	http://scholarbank.nus.edu.sg/handle/10635/44984
_version_	1821187764040761344

A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria

Similar Items