On the computation of fast data transmissions in networks with capacities and delays

dc.contributor.author	Καγάρης, Δημήτριος	el
dc.contributor.author	Πάντζιου, Γραμματή Ε.	el
dc.contributor.author	Τραγούδας, Σπύρος	el
dc.contributor.author	Ζαρολιάγκης, Χρήστος	el
dc.date.accessioned	2015-05-28T20:56:50Z
dc.date.available	2015-05-28T20:56:50Z
dc.date.issued	2015-05-28
dc.identifier.uri	http://hdl.handle.net/11400/11481
dc.rights	Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.source	http://link.springer.com/chapter/10.1007/3-540-60220-8_71	en
dc.subject	διαβίβαση δεδομένων
dc.subject	δίκτυα
dc.subject	ικανότητες και οι καθυστερήσεις
dc.subject	αλγόριθμοι
dc.subject	data transmissions
dc.subject	networks
dc.subject	capacities and delays
dc.subject	algorithms
dc.title	On the computation of fast data transmissions in networks with capacities and delays	en
heal.type	conferenceItem
heal.classification	Επιστήμες
heal.classification	Πληροφορική
heal.classification	Science
heal.classification	Computer science
heal.classificationURI	N/A-Επιστήμες
heal.classificationURI	N/A-Πληροφορική
heal.classificationURI	http://skos.um.es/unescothes/C03532
heal.classificationURI	http://skos.um.es/unescothes/C00750
heal.identifier.secondary	DOI: 10.1007/3-540-60220-8_71
heal.language	en
heal.access	campus
heal.recordProvider	Τεχνολογικό Εκπαιδευτικό Ίδρυμα Αθήνας. Σχολή Τεχνολογικών Εφαρμογών. Τμήμα Μηχανικών Πληροφορικής Τ.Ε.	el
heal.publicationDate	1995-08-16
heal.bibliographicCitation	Kagaris, D., Pantziou, G., Tragoudas, S. and Zaroliagis, C. (1995) On the computation of fast data transmissions in networks with capacities and delays.Proceedings of the 4th International Workshop, WADS '95. 55, pp.291-302. Kingston, Canada: Springer Berlin Heidelberg	en
heal.abstract	We examine the problem of transmitting in minimum time a given amount of data between a source and a destination in a network with finite channel capacities and non-zero propagation delays. In the absence of delays, the problem has been shown to be solvable in polynomial time. In this paper, we show that the general problem is NP-hard. In addition, we examine transmissions along a single path, called the quickest path, and present algorithms for general and sparse networks that outperform previous approaches. The first dynamic algorithm for the quickest path problem is also given.	en
heal.publisher	Springer Berlin Heidelberg	en
heal.fullTextAvailability	true
heal.conferenceName	Proceedings of the 4th International Workshop, WADS '95	en
heal.conferenceItemType	full paper