A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria

From MaRDI portal

Revision as of 12:42, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2719123

Jump to:navigation, search

DOI10.1137/S0097539798335596zbMath0980.68050MaRDI QIDQ2719123

No author found.

Publication date: 21 June 2001

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

linear programming approximation algorithms randomized algorithms randomized rounding multicommodity flow covering integer programs packet routing discrete ham-sandwich theorems rounding theorems

Mathematics Subject Classification ID

Hypergraphs (05C65) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (7)

Local ratio method on partial set multi-cover ⋮ Approximating covering integer programs with multiplicity constraints ⋮ Universal Packet Routing with Arbitrary Bandwidths and Transit Times ⋮ Approximation algorithm for partial positive influence problem in social network ⋮ Time-optimum packet scheduling for many-to-one routing in wireless sensor networks ⋮ Approximation algorithms for covering/packing integer programs ⋮ Bounding Residence Times for Atomic Dynamic Routings

This page was built for publication: A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2719123&oldid=15570293"