Matches in SemOpenAlex for { <https://semopenalex.org/work/W4300882829> ?p ?o ?g. }
Showing items 1 to 63 of
63
with 100 items per page.
- W4300882829 abstract "We have a set of processors (or agents) and a set of graph networks defined over some vertex set. Each processor can access a subset of the graph networks. Each processor has a demand specified as a pair of vertices $<u, v>$, along with a profit; the processor wishes to send data between $u$ and $v$. Towards that goal, the processor needs to select a graph network accessible to it and a path connecting $u$ and $v$ within the selected network. The processor requires exclusive access to the chosen path, in order to route the data. Thus, the processors are competing for routes/channels. A feasible solution selects a subset of demands and schedules each selected demand on a graph network accessible to the processor owning the demand; the solution also specifies the paths to use for this purpose. The requirement is that for any two demands scheduled on the same graph network, their chosen paths must be edge disjoint. The goal is to output a solution having the maximum aggregate profit. Prior work has addressed the above problem in a distibuted setting for the special case where all the graph networks are simply paths (i.e, line-networks). Distributed constant factor approximation algorithms are known for this case. The main contributions of this paper are twofold. First we design a distributed constant factor approximation algorithm for the more general case of tree-networks. The core component of our algorithm is a tree-decomposition technique, which may be of independent interest. Secondly, for the case of line-networks, we improve the known approximation guarantees by a factor of 5. Our algorithms can also handle the capacitated scenario, wherein the demands and edges have bandwidth requirements and capacities, respectively." @default.
- W4300882829 created "2022-10-04" @default.
- W4300882829 creator A5008813690 @default.
- W4300882829 creator A5020917225 @default.
- W4300882829 creator A5033885850 @default.
- W4300882829 date "2012-05-09" @default.
- W4300882829 modified "2023-10-14" @default.
- W4300882829 title "Distributed Algorithms for Scheduling on Line and Tree Networks" @default.
- W4300882829 doi "https://doi.org/10.48550/arxiv.1205.1924" @default.
- W4300882829 hasPublicationYear "2012" @default.
- W4300882829 type Work @default.
- W4300882829 citedByCount "0" @default.
- W4300882829 crossrefType "posted-content" @default.
- W4300882829 hasAuthorship W4300882829A5008813690 @default.
- W4300882829 hasAuthorship W4300882829A5020917225 @default.
- W4300882829 hasAuthorship W4300882829A5033885850 @default.
- W4300882829 hasBestOaLocation W43008828291 @default.
- W4300882829 hasConcept C102408133 @default.
- W4300882829 hasConcept C111919701 @default.
- W4300882829 hasConcept C11413529 @default.
- W4300882829 hasConcept C114614502 @default.
- W4300882829 hasConcept C120314980 @default.
- W4300882829 hasConcept C126255220 @default.
- W4300882829 hasConcept C127705205 @default.
- W4300882829 hasConcept C134306372 @default.
- W4300882829 hasConcept C206729178 @default.
- W4300882829 hasConcept C33923547 @default.
- W4300882829 hasConcept C41008148 @default.
- W4300882829 hasConcept C64331007 @default.
- W4300882829 hasConcept C77553402 @default.
- W4300882829 hasConcept C80444323 @default.
- W4300882829 hasConceptScore W4300882829C102408133 @default.
- W4300882829 hasConceptScore W4300882829C111919701 @default.
- W4300882829 hasConceptScore W4300882829C11413529 @default.
- W4300882829 hasConceptScore W4300882829C114614502 @default.
- W4300882829 hasConceptScore W4300882829C120314980 @default.
- W4300882829 hasConceptScore W4300882829C126255220 @default.
- W4300882829 hasConceptScore W4300882829C127705205 @default.
- W4300882829 hasConceptScore W4300882829C134306372 @default.
- W4300882829 hasConceptScore W4300882829C206729178 @default.
- W4300882829 hasConceptScore W4300882829C33923547 @default.
- W4300882829 hasConceptScore W4300882829C41008148 @default.
- W4300882829 hasConceptScore W4300882829C64331007 @default.
- W4300882829 hasConceptScore W4300882829C77553402 @default.
- W4300882829 hasConceptScore W4300882829C80444323 @default.
- W4300882829 hasLocation W43008828291 @default.
- W4300882829 hasLocation W43008828292 @default.
- W4300882829 hasLocation W43008828293 @default.
- W4300882829 hasOpenAccess W4300882829 @default.
- W4300882829 hasPrimaryLocation W43008828291 @default.
- W4300882829 hasRelatedWork W1522517976 @default.
- W4300882829 hasRelatedWork W1756885467 @default.
- W4300882829 hasRelatedWork W1882733036 @default.
- W4300882829 hasRelatedWork W1992741870 @default.
- W4300882829 hasRelatedWork W2024953199 @default.
- W4300882829 hasRelatedWork W2034668901 @default.
- W4300882829 hasRelatedWork W2160425906 @default.
- W4300882829 hasRelatedWork W2546696010 @default.
- W4300882829 hasRelatedWork W2884576438 @default.
- W4300882829 hasRelatedWork W2905364337 @default.
- W4300882829 isParatext "false" @default.
- W4300882829 isRetracted "false" @default.
- W4300882829 workType "article" @default.