Matches in SemOpenAlex for { <https://semopenalex.org/work/W2027682573> ?p ?o ?g. }
- W2027682573 endingPage "505" @default.
- W2027682573 startingPage "499" @default.
- W2027682573 abstract "We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in the tree. Specifically, we assume that if information from j sources is traveling over a link, the total information that needs to be transmitted is f(j). One natural and important (though not necessarily comprehensive) class of functions is those which are concave, non-decreasing, and satisfy f(0) = 0. Our goal is to find a tree which is a good approximation simultaneously to the optimum trees for all such functions. This problem is motivated by aggregation in sensor networks, as well as by buy-at-bulk network design.We present a randomized tree construction algorithm that guarantees E[maxfCf/C*(f)] 1 + log k, where Cf is a random variable denoting the cost of the tree for function f and C* (f) is the cost of the optimum tree for function f. To the best of our knowledge, this is the first result regarding simultaneous optimization for concave costs. We also show how to derandomize this result to obtain a deterministic algorithm that guarantees maxf/C*(f) = O(log k). Both these results are much stronger than merely obtaining a guarantee on maxfE[Cf/C* (f)]. A guarantee on maxfE[Cf/C* (f)] can be obtained using existing techniques, but this does not capture simultaneous optimization since no one tree is guaranteed to be a good approximation for all f simultaneously.While our analysis is quite involved, the algorithm itself is very simple and may well find practical use. We also hope that our techniques will prove useful for other problems where one needs simultaneous optimization for concave costs." @default.
- W2027682573 created "2016-06-24" @default.
- W2027682573 creator A5051162653 @default.
- W2027682573 creator A5051587086 @default.
- W2027682573 date "2003-01-12" @default.
- W2027682573 modified "2023-09-28" @default.
- W2027682573 title "Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk" @default.
- W2027682573 cites W1759768216 @default.
- W2027682573 cites W1786215221 @default.
- W2027682573 cites W2024631575 @default.
- W2027682573 cites W2041571997 @default.
- W2027682573 cites W2068871408 @default.
- W2027682573 cites W2082353536 @default.
- W2027682573 cites W2089897116 @default.
- W2027682573 cites W2104701012 @default.
- W2027682573 cites W2106676868 @default.
- W2027682573 cites W2114493937 @default.
- W2027682573 cites W2133156969 @default.
- W2027682573 cites W2141105412 @default.
- W2027682573 cites W2142758253 @default.
- W2027682573 cites W2142779979 @default.
- W2027682573 cites W2148251644 @default.
- W2027682573 cites W2151157922 @default.
- W2027682573 cites W2295428206 @default.
- W2027682573 cites W253059135 @default.
- W2027682573 cites W2270553684 @default.
- W2027682573 doi "https://doi.org/10.5555/644108.644191" @default.
- W2027682573 hasPublicationYear "2003" @default.
- W2027682573 type Work @default.
- W2027682573 sameAs 2027682573 @default.
- W2027682573 citedByCount "67" @default.
- W2027682573 countsByYear W20276825732012 @default.
- W2027682573 countsByYear W20276825732013 @default.
- W2027682573 countsByYear W20276825732014 @default.
- W2027682573 countsByYear W20276825732015 @default.
- W2027682573 countsByYear W20276825732019 @default.
- W2027682573 countsByYear W20276825732022 @default.
- W2027682573 crossrefType "proceedings-article" @default.
- W2027682573 hasAuthorship W2027682573A5051162653 @default.
- W2027682573 hasAuthorship W2027682573A5051587086 @default.
- W2027682573 hasConcept C112680207 @default.
- W2027682573 hasConcept C113174947 @default.
- W2027682573 hasConcept C114614502 @default.
- W2027682573 hasConcept C118615104 @default.
- W2027682573 hasConcept C126255220 @default.
- W2027682573 hasConcept C137836250 @default.
- W2027682573 hasConcept C14036430 @default.
- W2027682573 hasConcept C143050476 @default.
- W2027682573 hasConcept C148764684 @default.
- W2027682573 hasConcept C205649164 @default.
- W2027682573 hasConcept C2524010 @default.
- W2027682573 hasConcept C2781010653 @default.
- W2027682573 hasConcept C311688 @default.
- W2027682573 hasConcept C33923547 @default.
- W2027682573 hasConcept C41008148 @default.
- W2027682573 hasConcept C58640448 @default.
- W2027682573 hasConcept C63553672 @default.
- W2027682573 hasConcept C66690126 @default.
- W2027682573 hasConcept C78458016 @default.
- W2027682573 hasConcept C86803240 @default.
- W2027682573 hasConceptScore W2027682573C112680207 @default.
- W2027682573 hasConceptScore W2027682573C113174947 @default.
- W2027682573 hasConceptScore W2027682573C114614502 @default.
- W2027682573 hasConceptScore W2027682573C118615104 @default.
- W2027682573 hasConceptScore W2027682573C126255220 @default.
- W2027682573 hasConceptScore W2027682573C137836250 @default.
- W2027682573 hasConceptScore W2027682573C14036430 @default.
- W2027682573 hasConceptScore W2027682573C143050476 @default.
- W2027682573 hasConceptScore W2027682573C148764684 @default.
- W2027682573 hasConceptScore W2027682573C205649164 @default.
- W2027682573 hasConceptScore W2027682573C2524010 @default.
- W2027682573 hasConceptScore W2027682573C2781010653 @default.
- W2027682573 hasConceptScore W2027682573C311688 @default.
- W2027682573 hasConceptScore W2027682573C33923547 @default.
- W2027682573 hasConceptScore W2027682573C41008148 @default.
- W2027682573 hasConceptScore W2027682573C58640448 @default.
- W2027682573 hasConceptScore W2027682573C63553672 @default.
- W2027682573 hasConceptScore W2027682573C66690126 @default.
- W2027682573 hasConceptScore W2027682573C78458016 @default.
- W2027682573 hasConceptScore W2027682573C86803240 @default.
- W2027682573 hasLocation W20276825731 @default.
- W2027682573 hasOpenAccess W2027682573 @default.
- W2027682573 hasPrimaryLocation W20276825731 @default.
- W2027682573 hasRelatedWork W1542464532 @default.
- W2027682573 hasRelatedWork W2041571997 @default.
- W2027682573 hasRelatedWork W2077243267 @default.
- W2027682573 hasRelatedWork W2099213070 @default.
- W2027682573 hasRelatedWork W2104846640 @default.
- W2027682573 hasRelatedWork W2106335692 @default.
- W2027682573 hasRelatedWork W2110173519 @default.
- W2027682573 hasRelatedWork W2114124631 @default.
- W2027682573 hasRelatedWork W2117538122 @default.
- W2027682573 hasRelatedWork W2120417050 @default.
- W2027682573 hasRelatedWork W2121255383 @default.
- W2027682573 hasRelatedWork W2131791946 @default.
- W2027682573 hasRelatedWork W2133156969 @default.
- W2027682573 hasRelatedWork W2138256990 @default.
- W2027682573 hasRelatedWork W2148251644 @default.