Matches in SemOpenAlex for { <https://semopenalex.org/work/W2133156969> ?p ?o ?g. }
Showing items 1 to 57 of
57
with 100 items per page.
- W2133156969 abstract "The essence of the simplest buy-at-bulk network design problem is buying network capacity wholesale to guarantee connectivity from all network nodes to a certain central network switch. Capacity is sold with volume discount: the more capacity is bought, the cheaper is the price per unit of bandwidth. We provide O(log/sup 2/n) randomized approximation algorithm for the problem. This solves the open problem in Salman et al. (1997). The only previously known solutions were restricted to special cases (Euclidean graphs). We solve additional natural variations of the problem, such as multi-sink network design, as well as selective network design. These problems can be viewed as generalizations of the the Generalized Steiner Connectivity and Prize-collecting salesman (K-MST) problems. In the selective network design problem, some subset of /spl kappa/ wells must be connected to the (single) refinery, so that the total cost is minimized." @default.
- W2133156969 created "2016-06-24" @default.
- W2133156969 creator A5043112297 @default.
- W2133156969 creator A5082061504 @default.
- W2133156969 date "2002-11-23" @default.
- W2133156969 modified "2023-10-14" @default.
- W2133156969 title "Buy-at-bulk network design" @default.
- W2133156969 cites W1505879398 @default.
- W2133156969 cites W1981859328 @default.
- W2133156969 cites W1986056047 @default.
- W2133156969 cites W2001139415 @default.
- W2133156969 cites W2003281104 @default.
- W2133156969 cites W2011823863 @default.
- W2133156969 cites W2032389500 @default.
- W2133156969 cites W2088761355 @default.
- W2133156969 cites W2088812877 @default.
- W2133156969 cites W2147258429 @default.
- W2133156969 doi "https://doi.org/10.1109/sfcs.1997.646143" @default.
- W2133156969 hasPublicationYear "2002" @default.
- W2133156969 type Work @default.
- W2133156969 sameAs 2133156969 @default.
- W2133156969 citedByCount "135" @default.
- W2133156969 countsByYear W21331569692012 @default.
- W2133156969 countsByYear W21331569692013 @default.
- W2133156969 countsByYear W21331569692014 @default.
- W2133156969 countsByYear W21331569692015 @default.
- W2133156969 countsByYear W21331569692016 @default.
- W2133156969 countsByYear W21331569692017 @default.
- W2133156969 countsByYear W21331569692018 @default.
- W2133156969 countsByYear W21331569692019 @default.
- W2133156969 countsByYear W21331569692020 @default.
- W2133156969 countsByYear W21331569692021 @default.
- W2133156969 countsByYear W21331569692022 @default.
- W2133156969 crossrefType "proceedings-article" @default.
- W2133156969 hasAuthorship W2133156969A5043112297 @default.
- W2133156969 hasAuthorship W2133156969A5082061504 @default.
- W2133156969 hasBestOaLocation W21331569692 @default.
- W2133156969 hasConcept C41008148 @default.
- W2133156969 hasConceptScore W2133156969C41008148 @default.
- W2133156969 hasLocation W21331569691 @default.
- W2133156969 hasLocation W21331569692 @default.
- W2133156969 hasOpenAccess W2133156969 @default.
- W2133156969 hasPrimaryLocation W21331569691 @default.
- W2133156969 hasRelatedWork W2049775471 @default.
- W2133156969 hasRelatedWork W2093578348 @default.
- W2133156969 hasRelatedWork W2350741829 @default.
- W2133156969 hasRelatedWork W2358668433 @default.
- W2133156969 hasRelatedWork W2376932109 @default.
- W2133156969 hasRelatedWork W2382290278 @default.
- W2133156969 hasRelatedWork W2390279801 @default.
- W2133156969 hasRelatedWork W2748952813 @default.
- W2133156969 hasRelatedWork W2899084033 @default.
- W2133156969 hasRelatedWork W3004735627 @default.
- W2133156969 isParatext "false" @default.
- W2133156969 isRetracted "false" @default.
- W2133156969 magId "2133156969" @default.
- W2133156969 workType "article" @default.