{"entities":{"Q1853101":{"pageid":1863843,"ns":120,"title":"Item:Q1853101","lastrevid":71500965,"modified":"2026-04-13T22:40:51Z","type":"item","id":"Q1853101","labels":{"en":{"language":"en","value":"Algorithms for multicast connection under multi-path routing model."}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1856438"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1853101$3833F886-F1C7-44CB-9CD0-F1ED99CEF434","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"16b76f14fcec4ca95d101cd024a78c81e470dd0a","datavalue":{"value":{"text":"Algorithms for multicast connection under multi-path routing model.","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1853101$FB89E417-DB57-45CD-AE5D-365ADC69C7DB","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"d662875d4940658b75c7f8ddfaabb9b64f618ba8","datavalue":{"value":"1042.68005","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1853101$C34F5344-E9D9-45DA-8E3E-C5853BCE4E39","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"533dac03a8e138bb4a97a6e3254c9fa0b5984d02","datavalue":{"value":"10.1016/S0020-0190(02)00220-X","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1853101$4FF3BF2D-3430-4590-8A76-DE45423B80BB","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"673d424cd32a8922373044d7504d72be64f351fa","datavalue":{"value":{"entity-type":"item","numeric-id":192391,"id":"Q192391"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1853101$D96E1696-E2CE-4FF2-90FC-C3CA00CEF23A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"080eadc952b588b203ce842f84209cb836c98b9a","datavalue":{"value":{"entity-type":"item","numeric-id":166204,"id":"Q166204"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1853101$4DEFCF54-002D-4AA0-8F43-94E717E7F966","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b71e152e35bb0dfb7ffa2daf4464f9a75f717be0","datavalue":{"value":{"entity-type":"item","numeric-id":1853100,"id":"Q1853100"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1853101$E50F7AD5-CD90-4843-82B1-20EF9E6FA9B7","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"52fa7d44b58d0511cb8993765bd916aef86052d8","datavalue":{"value":{"entity-type":"item","numeric-id":63092,"id":"Q63092"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1853101$4324202B-2DB1-491B-8624-22841C26C5C2","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"5b5e42af6f5e314fbfeffbcec47ae99c9eed44fd","datavalue":{"value":{"time":"+2003-01-21T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1853101$4ACC893D-FF9E-4ED4-973B-AE785D29A159","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"9d516723d53796dbe395d9ad013209443f5e2fa9","datavalue":{"value":"Given a source node and a set of destination nodes in a network, multicast routing problem is usually treated as Steiner tree problem. Unlike this well-known tree based routing model, multicast routing under multi-path model is to find a set of paths rooted at the source node such that in each path at most a fixed number of destination nodes can be designated to receive the data and every destination node must be designated in a path to receive the data. The cost of routing is the total costs of paths found. In this paper we study how to construct a multicast routing of minimal cost under multi-path model. We propose two approximation algorithms for this NP-complete problem with guaranteed performance ratios.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1853101$65147AD5-61F5-4EBC-A2B8-925ACC4E6156","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ca8c16691e9ec83d46a3995338b09d48ac9660ac","datavalue":{"value":"68M10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1853101$CA2A175D-49F2-485D-9D45-3423D10EA9D1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"79b3bc872b6637176b35f9e46ac855febbf884f5","datavalue":{"value":"68W05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1853101$49C2FCD0-708D-4FF1-AAA6-A1A8B70ECD0A","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"73655ae9a827fbfe418b82161f48720ed85d9786","datavalue":{"value":"1856438","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1853101$BC57B3BA-790B-4B73-AFB6-8D8D92811924","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"67e7e36556995ed6e4efd35ea9b4f2478d3eb9a7","datavalue":{"value":"Multicast connection","type":"string"},"datatype":"string"},"type":"statement","id":"Q1853101$A87BF49D-EAFB-44EE-A409-6442C7AD2583","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"94ee947befeb3e52fe43090f5b5affac2f509592","datavalue":{"value":"Routing algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q1853101$602BB973-133A-40CC-B9EB-6C7B177D2707","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"32275484b70fee81c8f1fb6a4aee61198c9f0cb3","datavalue":{"value":"Network cost","type":"string"},"datatype":"string"},"type":"statement","id":"Q1853101$6947AEAA-876B-4E0E-B64A-AED3E7F70B61","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"dbff35acdd31439d13dd3892bdda5725c18fc300","datavalue":{"value":"Approximation algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q1853101$22894083-3A91-4B81-93E7-ED40C527B79F","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1853101$21F943AC-9A6E-4225-B66F-FD2EA050C804","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"acd26038edbe6565d3a8583ba4695f74dc5e165b","datavalue":{"value":{"entity-type":"item","numeric-id":4742316,"id":"Q4742316"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1853101$E75BDE64-6F88-431E-B261-985C5E04BF48","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"5a80eed9f379f185c9ca92aab1fa2ad3cc4463c9","datavalue":{"value":{"entity-type":"item","numeric-id":3887227,"id":"Q3887227"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1853101$4B01C5CA-0713-48CB-96D9-12D0A05A3373","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"d3dcc4318d82c60e62fc117c0c10950118f2ae66","datavalue":{"value":{"entity-type":"item","numeric-id":1145507,"id":"Q1145507"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1853101$C6FF3539-2F37-4870-8796-F3F55A13F1BD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"9ad86ed10f9dbc91aef6fdb78e5f6edf0ab2f5e6","datavalue":{"value":{"entity-type":"item","numeric-id":4739657,"id":"Q4739657"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1853101$E9E249C7-FCEF-4418-AB3B-286207A919A3","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"fd7a2b5db1889228a7100297583f7b476f89fd44","datavalue":{"value":"https://doi.org/10.1016/s0020-0190(02)00220-x","type":"string"},"datatype":"url"},"type":"statement","id":"Q1853101$5485987A-DEE9-41C6-8FD8-1604C143CA16","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"191a4c8355aead09997b03528d959bc5f9acb88d","datavalue":{"value":"W2045864518","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1853101$D6484C4E-F264-46E1-AACD-0D16E3AB45D9","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"70fcd19a2bfae503f6cf5dcdddb74b9e95b23ad8","datavalue":{"value":{"entity-type":"item","numeric-id":1884928,"id":"Q1884928"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"9647b7e006391e05cf4d11f4529a73d190f35da2","datavalue":{"value":{"amount":"+0.89256686","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ba354e87a58191d58d132c60481c945a3234ce85","datavalue":{"value":{"entity-type":"item","numeric-id":6534273,"id":"Q6534273"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1853101$F14ACB07-E1F3-4FFE-8AA6-BB3A20E2837A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"ab251c08d00d2120a22d30c963602ce512e66b93","datavalue":{"value":{"entity-type":"item","numeric-id":5314452,"id":"Q5314452"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"666c231884334aab661f06b626c44b8e8ff8596c","datavalue":{"value":{"amount":"+0.8827229","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ba354e87a58191d58d132c60481c945a3234ce85","datavalue":{"value":{"entity-type":"item","numeric-id":6534273,"id":"Q6534273"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1853101$C096F4BD-04D5-4F28-8EE6-1688C1363A5C","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Algorithms for multicast connection under multi-path routing model.","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Algorithms_for_multicast_connection_under_multi-path_routing_model."}}}}}