Matches in SemOpenAlex for { <https://semopenalex.org/work/W4247721708> ?p ?o ?g. }
Showing items 1 to 66 of
66
with 100 items per page.
- W4247721708 abstract "Previous chapter Next chapter Full AccessProceedings Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)A Max-Flow/Min-Cut Algorithm for a Class of Wireless NetworksS. M. Sadegh Tabatabaei Yazdi and Serap A. SavariS. M. Sadegh Tabatabaei Yazdi and Serap A. Savaripp.1209 - 1226Chapter DOI:https://doi.org/10.1137/1.9781611973075.97PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutAbstract The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information over wireless communication networks. The max-flow/min-cut theorem of Ford and Fulkerson has recently been extended to this wireless relay model. This result was first proved by a random coding scheme over large blocks of transmitted signals. We demonstrate the same result with a deterministic, polynomial-time algorithm which takes as input a single transmitted signal instead of a long block of signals. The max-flow/min-cut theorem of Ford and Fulkerson is related to a number of famous results in combinatorics including Hall's marriage theorem. Hall's marriage theorem is a special case of a well-known result in matroid theory and in transversal theory named the Rado-Hall theorem. We show that the max-flow/min-cut theorem for linear deterministic relay networks is connected to (1) a two-dimensional transversal theorem for block matrices which is a new application of the Rado-Hall theorem and (2) a combinatorial result on sequences of block matrices which is obtained through results in submodular optimization. Previous chapter Next chapter RelatedDetails Published:2010ISBN:978-0-89871-701-3eISBN:978-1-61197-307-5 https://doi.org/10.1137/1.9781611973075Book Series Name:ProceedingsBook Code:PR135Book Pages:xviii + 1667" @default.
- W4247721708 created "2022-05-12" @default.
- W4247721708 creator A5009369454 @default.
- W4247721708 creator A5072227716 @default.
- W4247721708 date "2010-01-17" @default.
- W4247721708 modified "2023-10-14" @default.
- W4247721708 title "A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks" @default.
- W4247721708 doi "https://doi.org/10.1137/1.9781611973075.97" @default.
- W4247721708 hasPublicationYear "2010" @default.
- W4247721708 type Work @default.
- W4247721708 citedByCount "4" @default.
- W4247721708 countsByYear W42477217082014 @default.
- W4247721708 countsByYear W42477217082021 @default.
- W4247721708 crossrefType "proceedings-article" @default.
- W4247721708 hasAuthorship W4247721708A5009369454 @default.
- W4247721708 hasAuthorship W4247721708A5072227716 @default.
- W4247721708 hasConcept C106286213 @default.
- W4247721708 hasConcept C11413529 @default.
- W4247721708 hasConcept C114614502 @default.
- W4247721708 hasConcept C114809511 @default.
- W4247721708 hasConcept C118615104 @default.
- W4247721708 hasConcept C121332964 @default.
- W4247721708 hasConcept C134306372 @default.
- W4247721708 hasConcept C163258240 @default.
- W4247721708 hasConcept C177148314 @default.
- W4247721708 hasConcept C2524010 @default.
- W4247721708 hasConcept C2778156585 @default.
- W4247721708 hasConcept C33923547 @default.
- W4247721708 hasConcept C38349280 @default.
- W4247721708 hasConcept C41008148 @default.
- W4247721708 hasConcept C555944384 @default.
- W4247721708 hasConcept C62520636 @default.
- W4247721708 hasConcept C76155785 @default.
- W4247721708 hasConceptScore W4247721708C106286213 @default.
- W4247721708 hasConceptScore W4247721708C11413529 @default.
- W4247721708 hasConceptScore W4247721708C114614502 @default.
- W4247721708 hasConceptScore W4247721708C114809511 @default.
- W4247721708 hasConceptScore W4247721708C118615104 @default.
- W4247721708 hasConceptScore W4247721708C121332964 @default.
- W4247721708 hasConceptScore W4247721708C134306372 @default.
- W4247721708 hasConceptScore W4247721708C163258240 @default.
- W4247721708 hasConceptScore W4247721708C177148314 @default.
- W4247721708 hasConceptScore W4247721708C2524010 @default.
- W4247721708 hasConceptScore W4247721708C2778156585 @default.
- W4247721708 hasConceptScore W4247721708C33923547 @default.
- W4247721708 hasConceptScore W4247721708C38349280 @default.
- W4247721708 hasConceptScore W4247721708C41008148 @default.
- W4247721708 hasConceptScore W4247721708C555944384 @default.
- W4247721708 hasConceptScore W4247721708C62520636 @default.
- W4247721708 hasConceptScore W4247721708C76155785 @default.
- W4247721708 hasLocation W42477217081 @default.
- W4247721708 hasOpenAccess W4247721708 @default.
- W4247721708 hasPrimaryLocation W42477217081 @default.
- W4247721708 hasRelatedWork W1829211283 @default.
- W4247721708 hasRelatedWork W1963746795 @default.
- W4247721708 hasRelatedWork W1978795414 @default.
- W4247721708 hasRelatedWork W2040455566 @default.
- W4247721708 hasRelatedWork W2052105967 @default.
- W4247721708 hasRelatedWork W2053598067 @default.
- W4247721708 hasRelatedWork W2206386752 @default.
- W4247721708 hasRelatedWork W3201876934 @default.
- W4247721708 hasRelatedWork W4291556988 @default.
- W4247721708 hasRelatedWork W4301139944 @default.
- W4247721708 isParatext "false" @default.
- W4247721708 isRetracted "false" @default.
- W4247721708 workType "article" @default.