{"title":"Constructive bounds and exact expectations for the random assignment problem","authors":"D. Coppersmith, G. Sorkin","doi":"10.1002/(SICI)1098-2418(199909)15:2%3C113::AID-RSA1%3E3.0.CO;2-S","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":303496,"journal":{"name":"Random Struct. Algorithms","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"60","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Random Struct. Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/(SICI)1098-2418(199909)15:2%3C113::AID-RSA1%3E3.0.CO;2-S","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}