Matches in SemOpenAlex for { <https://semopenalex.org/work/W2888234005> ?p ?o ?g. }
Showing items 1 to 69 of
69
with 100 items per page.
- W2888234005 abstract "Motivated by applications in distributed storage, the storage capacity of a graph was recently defined to be the maximum amount of information that can be stored across the vertices of a graph such that the information at any vertex can be recovered from the information stored at the neighboring vertices. Computing the storage capacity is a fundamental problem in network coding and is related, or equivalent, to some well-studied problems such as index coding with side information and generalized guessing games. In this paper, we consider storage capacity as a natural information-theoretic analogue of the minimum vertex cover of a graph. Indeed, while it was known that storage capacity is upper bounded by minimum vertex cover, we show that by treating it as such we can get a 3/2 approximation for planar graphs, and a 4/3 approximation for triangle-free planar graphs. Since the storage capacity is intimately related to the index coding rate, we get a 2 approximation of index coding rate for planar graphs and 3/2 approximation for triangle-free planar graphs. We also show a polynomial time approximation scheme for the index coding rate when the alphabet size is constant. We then develop a general method of gadget covering to upper bound the storage capacity in terms of the average of a set of vertex covers. This method is intuitive and leads to the exact characterization of storage capacity for various families of graphs. As an illustrative example, we use this approach to derive the exact storage capacity of cycles-with-chords, a family of graphs related to outerplanar graphs. Finally, we generalize the storage capacity notion to include recovery from partial node failures in distributed storage. We show tight upper and lower bounds on this partial recovery capacity that scales nicely with the fraction of failures in a vertex." @default.
- W2888234005 created "2018-08-31" @default.
- W2888234005 creator A5041251603 @default.
- W2888234005 creator A5051046818 @default.
- W2888234005 creator A5084897290 @default.
- W2888234005 date "2017-06-28" @default.
- W2888234005 modified "2023-09-26" @default.
- W2888234005 title "Storage Capacity as an Information-Theoretic Vertex Cover and the Index Coding Rate" @default.
- W2888234005 hasPublicationYear "2017" @default.
- W2888234005 type Work @default.
- W2888234005 sameAs 2888234005 @default.
- W2888234005 citedByCount "0" @default.
- W2888234005 crossrefType "posted-content" @default.
- W2888234005 hasAuthorship W2888234005A5041251603 @default.
- W2888234005 hasAuthorship W2888234005A5051046818 @default.
- W2888234005 hasAuthorship W2888234005A5084897290 @default.
- W2888234005 hasConcept C114614502 @default.
- W2888234005 hasConcept C118615104 @default.
- W2888234005 hasConcept C132525143 @default.
- W2888234005 hasConcept C134306372 @default.
- W2888234005 hasConcept C148764684 @default.
- W2888234005 hasConcept C161677786 @default.
- W2888234005 hasConcept C28723256 @default.
- W2888234005 hasConcept C33923547 @default.
- W2888234005 hasConcept C34388435 @default.
- W2888234005 hasConcept C40687702 @default.
- W2888234005 hasConcept C41008148 @default.
- W2888234005 hasConcept C77553402 @default.
- W2888234005 hasConcept C80899671 @default.
- W2888234005 hasConceptScore W2888234005C114614502 @default.
- W2888234005 hasConceptScore W2888234005C118615104 @default.
- W2888234005 hasConceptScore W2888234005C132525143 @default.
- W2888234005 hasConceptScore W2888234005C134306372 @default.
- W2888234005 hasConceptScore W2888234005C148764684 @default.
- W2888234005 hasConceptScore W2888234005C161677786 @default.
- W2888234005 hasConceptScore W2888234005C28723256 @default.
- W2888234005 hasConceptScore W2888234005C33923547 @default.
- W2888234005 hasConceptScore W2888234005C34388435 @default.
- W2888234005 hasConceptScore W2888234005C40687702 @default.
- W2888234005 hasConceptScore W2888234005C41008148 @default.
- W2888234005 hasConceptScore W2888234005C77553402 @default.
- W2888234005 hasConceptScore W2888234005C80899671 @default.
- W2888234005 hasLocation W28882340051 @default.
- W2888234005 hasOpenAccess W2888234005 @default.
- W2888234005 hasPrimaryLocation W28882340051 @default.
- W2888234005 hasRelatedWork W1521302999 @default.
- W2888234005 hasRelatedWork W1560183925 @default.
- W2888234005 hasRelatedWork W1772739528 @default.
- W2888234005 hasRelatedWork W1862378619 @default.
- W2888234005 hasRelatedWork W2062135503 @default.
- W2888234005 hasRelatedWork W2081449822 @default.
- W2888234005 hasRelatedWork W2083522899 @default.
- W2888234005 hasRelatedWork W2133304595 @default.
- W2888234005 hasRelatedWork W2261198898 @default.
- W2888234005 hasRelatedWork W2730158636 @default.
- W2888234005 hasRelatedWork W2885321421 @default.
- W2888234005 hasRelatedWork W2914071196 @default.
- W2888234005 hasRelatedWork W2942135920 @default.
- W2888234005 hasRelatedWork W2942388931 @default.
- W2888234005 hasRelatedWork W2963771722 @default.
- W2888234005 hasRelatedWork W2963857389 @default.
- W2888234005 hasRelatedWork W2965904208 @default.
- W2888234005 hasRelatedWork W2967673620 @default.
- W2888234005 hasRelatedWork W3098082123 @default.
- W2888234005 hasRelatedWork W894376071 @default.
- W2888234005 isParatext "false" @default.
- W2888234005 isRetracted "false" @default.
- W2888234005 magId "2888234005" @default.
- W2888234005 workType "article" @default.