%0 Conference Paper %1 conf/networking/RetvariSB04 %A Rétvári, Gábor %A Szabó, Róbert %A Bíró, József %B NETWORKING %D 2004 %E Mitrou, Nikolas %E Kontovasilis, Kimon P. %E Rouskas, George N. %E Iliadis, Ilias %E Merakos, Lazaros F. %I Springer %K dblp %P 1180-1191 %T On the Representability of Arbitrary Path Sets as Shortest Paths: Theory, Algorithms, and Complexity. %U http://dblp.uni-trier.de/db/conf/networking/networking2004.html#RetvariSB04 %V 3042 %@ 3-540-21959-5

@inproceedings{conf/networking/RetvariSB04, added-at = {2017-05-26T00:00:00.000+0200}, author = {Rétvári, Gábor and Szabó, Róbert and Bíró, József}, biburl = {https://www.bibsonomy.org/bibtex/235891a90543c7d10149ac0dbe71e2d72/dblp}, booktitle = {NETWORKING}, crossref = {conf/networking/2004}, editor = {Mitrou, Nikolas and Kontovasilis, Kimon P. and Rouskas, George N. and Iliadis, Ilias and Merakos, Lazaros F.}, ee = {https://doi.org/10.1007/978-3-540-24693-0_97}, interhash = {62cb8cb4efddb4edf164e8c6045881c9}, intrahash = {35891a90543c7d10149ac0dbe71e2d72}, isbn = {3-540-21959-5}, keywords = {dblp}, pages = {1180-1191}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T12:49:40.000+0200}, title = {On the Representability of Arbitrary Path Sets as Shortest Paths: Theory, Algorithms, and Complexity.}, url = {http://dblp.uni-trier.de/db/conf/networking/networking2004.html#RetvariSB04}, volume = 3042, year = 2004 }