FRINK Linked Data Fragments server

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

• W2002077709 endingPage "475" @default.
• W2002077709 startingPage "453" @default.
• W2002077709 abstract "In the gathering problem, a particular node in a graph, the base station , aims at receiving messages from some nodes in the graph. At each step, a node can send one message to one of its neighbors (such an action is called a call ). However, a node cannot send and receive a message during the same step. Moreover, the communication is subject to interference constraints, more precisely, two calls interfere in a step, if one sender is at distance at most d I from the other receiver. Given a graph with a base station and a set of nodes having some messages, the goal of the gathering problem is to compute a schedule of calls for the base station to receive all messages as fast as possible, i.e., minimizing the number of steps (called makespan ). The gathering problem is equivalent to the personalized broadcasting problem where the base station has to send messages to some nodes in the graph, with same transmission constraints. In this paper, we focus on the gathering and personalized broadcasting problem in grids. Moreover, we consider the non-buffering model: when a node receives a message at some step, it must transmit it during the next step. In this setting, though the problem of determining the complexity of computing the optimal makespan in a grid is still open, we present linear (in the number of messages) algorithms that compute schedules for gathering with d I ∈ { 0 , 1 , 2 } . In particular, we present an algorithm that achieves the optimal makespan up to an additive constant 2 when d I = 0 . If no messages are “close” to the axes (the base station being the origin), our algorithms achieve the optimal makespan up to an additive constant 1 when d I = 0 , 4 when d I = 2 , and 3 when both d I = 1 and the base station is in a corner. Note that, the approximation algorithms that we present also provide approximation up to a ratio 2 for the gathering with buffering. All our results are proved in terms of personalized broadcasting." @default.
• W2002077709 created "2016-06-24" @default.
• W2002077709 creator A5038712245 @default.
• W2002077709 creator A5057804168 @default.
• W2002077709 creator A5080300919 @default.
• W2002077709 creator A5085133941 @default.
• W2002077709 creator A5086263228 @default.
• W2002077709 date "2015-01-01" @default.
• W2002077709 modified "2023-10-17" @default.
• W2002077709 title "Data gathering and personalized broadcasting in radio grids with interference" @default.
• W2002077709 cites W1486228503 @default.
• W2002077709 cites W1498690688 @default.
• W2002077709 cites W1503771076 @default.
• W2002077709 cites W1583007500 @default.
• W2002077709 cites W2009769295 @default.
• W2002077709 cites W2040333990 @default.
• W2002077709 cites W2051089411 @default.
• W2002077709 cites W2059986173 @default.
• W2002077709 cites W2107364542 @default.
• W2002077709 cites W2115375706 @default.
• W2002077709 cites W2118977710 @default.
• W2002077709 cites W2130626076 @default.
• W2002077709 cites W2134918076 @default.
• W2002077709 cites W2143937928 @default.
• W2002077709 cites W2148157898 @default.
• W2002077709 cites W2165676209 @default.
• W2002077709 cites W2400748669 @default.
• W2002077709 cites W2587802547 @default.
• W2002077709 doi "https://doi.org/10.1016/j.tcs.2014.10.029" @default.
• W2002077709 hasPublicationYear "2015" @default.
• W2002077709 type Work @default.
• W2002077709 sameAs 2002077709 @default.
• W2002077709 citedByCount "3" @default.
• W2002077709 countsByYear W20020777092014 @default.
• W2002077709 countsByYear W20020777092016 @default.
• W2002077709 crossrefType "journal-article" @default.
• W2002077709 hasAuthorship W2002077709A5038712245 @default.
• W2002077709 hasAuthorship W2002077709A5057804168 @default.
• W2002077709 hasAuthorship W2002077709A5080300919 @default.
• W2002077709 hasAuthorship W2002077709A5085133941 @default.
• W2002077709 hasAuthorship W2002077709A5086263228 @default.
• W2002077709 hasBestOaLocation W20020777091 @default.
• W2002077709 hasConcept C110157686 @default.
• W2002077709 hasConcept C127162648 @default.
• W2002077709 hasConcept C31258907 @default.
• W2002077709 hasConcept C32022120 @default.
• W2002077709 hasConcept C41008148 @default.
• W2002077709 hasConcept C58911810 @default.
• W2002077709 hasConcept C76155785 @default.
• W2002077709 hasConceptScore W2002077709C110157686 @default.
• W2002077709 hasConceptScore W2002077709C127162648 @default.
• W2002077709 hasConceptScore W2002077709C31258907 @default.
• W2002077709 hasConceptScore W2002077709C32022120 @default.
• W2002077709 hasConceptScore W2002077709C41008148 @default.
• W2002077709 hasConceptScore W2002077709C58911810 @default.
• W2002077709 hasConceptScore W2002077709C76155785 @default.
• W2002077709 hasFunder F4320320883 @default.
• W2002077709 hasLocation W20020777091 @default.
• W2002077709 hasLocation W20020777092 @default.
• W2002077709 hasLocation W20020777093 @default.
• W2002077709 hasOpenAccess W2002077709 @default.
• W2002077709 hasPrimaryLocation W20020777091 @default.
• W2002077709 hasRelatedWork W1984632043 @default.
• W2002077709 hasRelatedWork W2613913289 @default.
• W2002077709 hasRelatedWork W2883419526 @default.
• W2002077709 hasRelatedWork W2903979341 @default.
• W2002077709 hasRelatedWork W3175872264 @default.
• W2002077709 hasRelatedWork W3190457193 @default.
• W2002077709 hasRelatedWork W4206336776 @default.
• W2002077709 hasRelatedWork W4238346783 @default.
• W2002077709 hasRelatedWork W4379377929 @default.
• W2002077709 hasRelatedWork W610673289 @default.
• W2002077709 hasVolume "562" @default.
• W2002077709 isParatext "false" @default.
• W2002077709 isRetracted "false" @default.
• W2002077709 magId "2002077709" @default.
• W2002077709 workType "article" @default.