FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W3049110439> ?p ?o ?g. }

• W3049110439 endingPage "2150008" @default.
• W3049110439 startingPage "2150008" @default.
• W3049110439 abstract "The Prize-collecting Steiner tree (PCST) problem is a generalization of the Steiner tree problem that finds applications in network design, content distribution networks, and many more. There are a few centralized approximation algorithms [D. Bienstock, M. X. Goemans, D. Simchi-Levi and D. Williamson, A note on the prize collecting traveling salesman problem. Math. Program. 59 (1993) 413–420; M. X. Goemans and D. E. Williamson, A general approximation technique for constrained forest problems, SIAM J. Appl. Math. 24(2) (1995) 296–317; D. S. Johnson, M. Minkoff and S. Phillips, The prize collecting Steiner tree problem: Theory and practice, in Proc. Eleventh Annual ACM-SIAM Symp. Discrete Algorithms, SODA ’00 (2000), pp. 760–769; A. Archer, M. Hossein Bateni and M. Taghi Hajiaghayi, Improved approximation algorithms for prize-collecting Steiner tree and TSP, SIAM J. Comput. 40(2) (2011) 309–332] for solving the PCST problem. However, the problem has seen very little progress in the distributed setting; to the best of our knowledge, the only distributed algorithms proposed so far are due to Rossetti [N. G. Rossetti, A first attempt on the distributed prize-collecting Steiner tree problem, M.Sc. thesis, University of Iceland, Reykjavik (2015)]: one of them fails to guarantee a constant approximation factor while the other one is essentially centralized. In this work, first, we present a deterministic [Formula: see text] factor distributed approximation algorithm (D-PCST algorithm) that constructs a PCST for a given connected undirected graph of [Formula: see text] nodes with non-negative edge weights and non-negative prize value for each node. The D-PCST algorithm is based on the primal-dual method and uses a technique of preserving dual constraints in a distributed manner, without relying on knowledge of the global structure of the network. For an input graph [Formula: see text], the round and message complexities of the D-PCST algorithm in the CONGEST model are [Formula: see text] and [Formula: see text] respectively, where [Formula: see text] and [Formula: see text]. Furthermore, we modify the D-PCST algorithm and show that a [Formula: see text]-approximate PCST can be deterministically computed using [Formula: see text] rounds and [Formula: see text] messages in the CONGEST model, where [Formula: see text] is the unweighted diameter of [Formula: see text]. For networks with [Formula: see text], the modified D-PCST algorithm performs better than the original one in terms of the round complexity. Both the algorithms require [Formula: see text] bits of memory in each node, where [Formula: see text] is the maximum degree of a node in the graph." @default.
• W3049110439 created "2020-08-21" @default.
• W3049110439 creator A5077975268 @default.
• W3049110439 creator A5080119085 @default.
• W3049110439 creator A5091546742 @default.
• W3049110439 date "2020-09-26" @default.
• W3049110439 modified "2023-09-24" @default.
• W3049110439 title "Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree" @default.
• W3049110439 cites W132245160 @default.
• W3049110439 cites W1578705518 @default.
• W3049110439 cites W1881248737 @default.
• W3049110439 cites W1928638915 @default.
• W3049110439 cites W1968304853 @default.
• W3049110439 cites W1984090926 @default.
• W3049110439 cites W1986056047 @default.
• W3049110439 cites W1991055327 @default.
• W3049110439 cites W1991107961 @default.
• W3049110439 cites W2011823863 @default.
• W3049110439 cites W2015819397 @default.
• W3049110439 cites W2030825457 @default.
• W3049110439 cites W2040273581 @default.
• W3049110439 cites W2042437235 @default.
• W3049110439 cites W2044119054 @default.
• W3049110439 cites W2048013200 @default.
• W3049110439 cites W2056399203 @default.
• W3049110439 cites W2058191123 @default.
• W3049110439 cites W2062310236 @default.
• W3049110439 cites W2071057992 @default.
• W3049110439 cites W2074613642 @default.
• W3049110439 cites W2077371116 @default.
• W3049110439 cites W2087987937 @default.
• W3049110439 cites W2099618932 @default.
• W3049110439 cites W2107338086 @default.
• W3049110439 cites W2118486696 @default.
• W3049110439 cites W2123087902 @default.
• W3049110439 cites W2401610261 @default.
• W3049110439 cites W4205300528 @default.
• W3049110439 doi "https://doi.org/10.1142/s1793830921500087" @default.
• W3049110439 hasPublicationYear "2020" @default.
• W3049110439 type Work @default.
• W3049110439 sameAs 3049110439 @default.
• W3049110439 citedByCount "1" @default.
• W3049110439 countsByYear W30491104392021 @default.
• W3049110439 crossrefType "journal-article" @default.
• W3049110439 hasAuthorship W3049110439A5077975268 @default.
• W3049110439 hasAuthorship W3049110439A5080119085 @default.
• W3049110439 hasAuthorship W3049110439A5091546742 @default.
• W3049110439 hasBestOaLocation W30491104392 @default.
• W3049110439 hasConcept C113174947 @default.
• W3049110439 hasConcept C11413529 @default.
• W3049110439 hasConcept C114614502 @default.
• W3049110439 hasConcept C118615104 @default.
• W3049110439 hasConcept C130120984 @default.
• W3049110439 hasConcept C134306372 @default.
• W3049110439 hasConcept C148764684 @default.
• W3049110439 hasConcept C175859090 @default.
• W3049110439 hasConcept C177148314 @default.
• W3049110439 hasConcept C199360897 @default.
• W3049110439 hasConcept C33923547 @default.
• W3049110439 hasConcept C41008148 @default.
• W3049110439 hasConcept C76220878 @default.
• W3049110439 hasConceptScore W3049110439C113174947 @default.
• W3049110439 hasConceptScore W3049110439C11413529 @default.
• W3049110439 hasConceptScore W3049110439C114614502 @default.
• W3049110439 hasConceptScore W3049110439C118615104 @default.
• W3049110439 hasConceptScore W3049110439C130120984 @default.
• W3049110439 hasConceptScore W3049110439C134306372 @default.
• W3049110439 hasConceptScore W3049110439C148764684 @default.
• W3049110439 hasConceptScore W3049110439C175859090 @default.
• W3049110439 hasConceptScore W3049110439C177148314 @default.
• W3049110439 hasConceptScore W3049110439C199360897 @default.
• W3049110439 hasConceptScore W3049110439C33923547 @default.
• W3049110439 hasConceptScore W3049110439C41008148 @default.
• W3049110439 hasConceptScore W3049110439C76220878 @default.
• W3049110439 hasIssue "02" @default.
• W3049110439 hasLocation W30491104391 @default.
• W3049110439 hasLocation W30491104392 @default.
• W3049110439 hasOpenAccess W3049110439 @default.
• W3049110439 hasPrimaryLocation W30491104391 @default.
• W3049110439 hasRelatedWork W11928021 @default.
• W3049110439 hasRelatedWork W120343 @default.
• W3049110439 hasRelatedWork W403955 @default.
• W3049110439 hasRelatedWork W6389925 @default.
• W3049110439 hasRelatedWork W6404409 @default.
• W3049110439 hasRelatedWork W6720445 @default.
• W3049110439 hasRelatedWork W7608756 @default.
• W3049110439 hasRelatedWork W836113 @default.
• W3049110439 hasRelatedWork W8535076 @default.
• W3049110439 hasRelatedWork W9182050 @default.
• W3049110439 hasVolume "13" @default.
• W3049110439 isParatext "false" @default.
• W3049110439 isRetracted "false" @default.
• W3049110439 magId "3049110439" @default.
• W3049110439 workType "article" @default.