Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

On the Hardness of Approximating the Multicast Delay Variation Problem

From MaRDI portal
Publication:4564245
Jump to:navigation, search

DOI10.1109/TC.2007.1046zbMATH Open1390.68325OpenAlexW2138830555MaRDI QIDQ4564245FDOQ4564245


Authors: Pi-Rong Sheu, Shan-Tai Chen Edit this on Wikidata


Publication date: 12 June 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2007.1046





Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)







This page was built for publication: On the Hardness of Approximating the Multicast Delay Variation Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4564245)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4564245&oldid=18698257"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 11:33. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki