{"id":15074,"date":"2022-06-16T20:40:36","date_gmt":"2022-06-17T00:40:36","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=15074"},"modified":"2026-06-08T15:06:39","modified_gmt":"2026-06-08T19:06:39","slug":"tr-220-on-multi-label-linear-interval-routing-schemes","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/tr-220-on-multi-label-linear-interval-routing-schemes\/","title":{"rendered":"TR-220: On Multi-label Linear Interval Routing Schemes"},"content":{"rendered":"\n<section class=\"w-screen px-6 cu-section cu-section--white ml-offset-center md:px-8 lg:px-14\">\n    <div class=\"space-y-6 cu-max-w-child-5xl  md:space-y-10 cu-prose-first-last\">\n\n            <div class=\"cu-textmedia flex flex-col lg:flex-row mx-auto gap-6 md:gap-10 my-6 md:my-12 first:mt-0 max-w-5xl\">\n        <div class=\"justify-start cu-textmedia-content cu-prose-first-last\" style=\"flex: 0 0 100%;\">\n            <header class=\"font-light prose-xl cu-pageheader md:prose-2xl cu-component-updated cu-prose-first-last\">\n                                    <h1 class=\"cu-prose-first-last font-semibold !mt-2 mb-4 md:mb-6 relative after:absolute after:h-px after:bottom-0 after:bg-cu-red after:left-px text-3xl md:text-4xl lg:text-5xl lg:leading-[3.5rem] pb-5 after:w-10 text-cu-black-700 not-prose\">\n                        TR-220: On Multi-label Linear Interval Routing Schemes\n                    <\/h1>\n                \n                                \n                            <\/header>\n\n                    <\/div>\n\n            <\/div>\n\n    <\/div>\n<\/section>\n\n\n\n<p>Carleton University<br><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/\">Technical Report<\/a>&nbsp;<strong>TR-220<\/strong><br>March 1993<\/p>\n\n\n\n<h2 id=\"on-multi-label-linear-interval-routing-schemes\" class=\"wp-block-heading\">On Multi-label Linear Interval Routing Schemes<\/h2>\n\n\n\n<p>Evangelos Kranakis, Danny Krizanc, S.S. Ravi<\/p>\n\n\n\n<h3 id=\"abstract\" class=\"wp-block-heading\">Abstract<\/h3>\n\n\n\n<p>We consider linear interval routing schemes studied in [3, 5] from a graph theoretic perspective. We examine how the number of linear intervals needed to obtain shortest path routings in networks is affected by the product and join operations on graphs. This approach allows us to generalize some of the results in [3, 5] concerning the minimum number of intervals needed to achieve shortest path routings in certain special classes of networks. We also establish the precise value of the minimum number of intervals needed to achieve shortest path routings in the network considered in [10].<\/p>\n\n\n\n<p><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-220.pdf\">TR-220.pdf<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Carleton UniversityTechnical Report&nbsp;TR-220March 1993 On Multi-label Linear Interval Routing Schemes Evangelos Kranakis, Danny Krizanc, S.S. Ravi Abstract We consider linear interval routing schemes studied in [3, 5] from a graph theoretic perspective. We examine how the number of linear intervals needed to obtain shortest path routings in networks is affected by the product and join [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":11912,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"_cu_dining_location_slug":"","footnotes":"","_links_to":"","_links_to_target":""},"cu_page_type":[],"class_list":["post-15074","page","type-page","status-publish","hentry"],"acf":{"cu_post_thumbnail":""},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/15074","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/comments?post=15074"}],"version-history":[{"count":3,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/15074\/revisions"}],"predecessor-version":[{"id":24461,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/15074\/revisions\/24461"}],"up":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11912"}],"wp:attachment":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/media?parent=15074"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=15074"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}