Abstract
The problem of finding the shortest path between two points underlies the concept of distance. In the common understanding, the physical distance between two points is always regarded as a non-negative quantity. However, from a mathematical point of view, the shortest-path problem can be defined and solved even when distances between points are negative. In this chapter we show that this model has an engineering application in the problem of synchronizing several electromagnetic signals received by a set of antennas. Solving this problem is fundamental in the design and implementation of digital television networks.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
AGCOM: Piano nazionale di assegnazione delle frequenze per la radiodiffusione televisiva. Autorità per le Garanzie nelle Comunicazioni (1998). http://www2.agcom.it/provv/pnf/target01.htm
AGCOM: Il libro bianco sulla televisione digitale terrestre. Autorità per le Garanzie nelle Comunicazioni (2000). http://www2.agcom.it/provv/libro_b_00/librobianco00.htm
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs (1993)
EBU: Terrestrial digital television planning and implementation considerations. European Broadcasting Union, BPN 005, 2nd issue (1997)
Rappaport, T.S.: Wireless Communications: Principles and Practice, 2nd edn. Prentice Hall, Upper Saddle River, New Jersey, USA (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Rossi, F., Sassano, A., Smriglio, S. (2013). The Shortest Walk to Watch TV. In: Ausiello, G., Petreschi, R. (eds) The Power of Algorithms. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39652-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-39652-6_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39651-9
Online ISBN: 978-3-642-39652-6
eBook Packages: Computer ScienceComputer Science (R0)