{"id":"https://openalex.org/W2139235151","doi":"https://doi.org/10.1184/r1/6714839","title":"Approximation Techniques for Stochastic Combinatorial Optimization Problems","display_name":"Approximation Techniques for Stochastic Combinatorial Optimization Problems","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2139235151","doi":"https://doi.org/10.1184/r1/6714839","mag":"2139235151"},"language":"en","primary_location":{"id":"pmh:oai:repository.cmu.edu:dissertations-1162","doi":null,"is_oa":true,"landing_page_url":"http://repository.cmu.edu/cgi/viewcontent.cgi?article=1162&context=dissertations","pdf_url":"http://repository.cmu.edu/dissertations/157","source":{"id":"https://openalex.org/S7407050927","display_name":"KiltHub Repository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I74973139","host_organization_name":"Carnegie Mellon University","host_organization_lineage":["https://openalex.org/I74973139"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Dissertations","raw_type":"text"},"volume":null,"type":"dissertation","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://repository.cmu.edu/dissertations/157","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060555975","display_name":"Ravishankar Krishnaswamy","orcid":"https://orcid.org/0000-0002-5765-0843","observed_orcids":["https://orcid.org/0000-0002-5765-0843"]},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ravishankar  Krishnaswamy","raw_affiliation_strings":["Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5060555975"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9154999852180481,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9154999852180481,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.07569999992847443,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.0013000000035390258,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/stochastic-combinatorial-optimization","display_name":"stochastic combinatorial optimization","score":0.9390000104904175},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.9919999837875366},{"id":"https://openalex.org/keywords/approximation-guarantees","display_name":"approximation guarantees","score":0.8140000104904175},{"id":"https://openalex.org/keywords/survivable-network-design","display_name":"survivable network design","score":0.8870000243186951},{"id":"https://openalex.org/keywords/multi-armed-bandits","display_name":"multi-armed bandits","score":0.9750000238418579},{"id":"https://openalex.org/keywords/np-hard-problems","display_name":"NP-hard problems","score":0.6169999837875366},{"id":"https://openalex.org/keywords/markov-chains","display_name":"Markov chains","score":0.718999981880188}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.6912983655929565},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6237932443618774},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.55043625831604},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.5454744100570679},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5417897701263428},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.5365192294120789},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5254862904548645},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5134445428848267},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4827096462249756},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.47292453050613403},{"id":"https://openalex.org/C75782508","wikidata":"https://www.wikidata.org/wiki/Q3333633","display_name":"Cross-entropy method","level":4,"score":0.43495649099349976},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.315868079662323},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.25777894258499146},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.10271021723747253},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:repository.cmu.edu:dissertations-1162","doi":null,"is_oa":true,"landing_page_url":"http://repository.cmu.edu/cgi/viewcontent.cgi?article=1162&context=dissertations","pdf_url":"http://repository.cmu.edu/dissertations/157","source":{"id":"https://openalex.org/S7407050927","display_name":"KiltHub Repository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I74973139","host_organization_name":"Carnegie Mellon University","host_organization_lineage":["https://openalex.org/I74973139"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Dissertations","raw_type":"text"},{"id":"pmh:oai:figshare.com:article/6714839","doi":null,"is_oa":true,"landing_page_url":"https://figshare.com/articles/thesis/Approximation_Techniques_for_Stochastic_Combinatorial_Optimization_Problems/6714839","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},{"id":"mag:2139235151","doi":null,"is_oa":false,"landing_page_url":"http://repository.cmu.edu/cgi/viewcontent.cgi?article=1162&context=dissertations","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"doi:10.1184/r1/6714839","doi":"https://doi.org/10.1184/r1/6714839","is_oa":true,"landing_page_url":"https://doi.org/10.1184/r1/6714839","pdf_url":null,"source":{"id":"https://openalex.org/S7407050927","display_name":"KiltHub Repository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I74973139","host_organization_name":"Carnegie Mellon University","host_organization_lineage":["https://openalex.org/I74973139"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},{"id":"doi:10.1184/r1/6714839.v1","doi":"https://doi.org/10.1184/r1/6714839.v1","is_oa":true,"landing_page_url":"https://doi.org/10.1184/r1/6714839.v1","pdf_url":null,"source":{"id":"https://openalex.org/S7407050927","display_name":"KiltHub Repository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I74973139","host_organization_name":"Carnegie Mellon University","host_organization_lineage":["https://openalex.org/I74973139"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:repository.cmu.edu:dissertations-1162","doi":null,"is_oa":true,"landing_page_url":"http://repository.cmu.edu/cgi/viewcontent.cgi?article=1162&context=dissertations","pdf_url":"http://repository.cmu.edu/dissertations/157","source":{"id":"https://openalex.org/S7407050927","display_name":"KiltHub Repository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I74973139","host_organization_name":"Carnegie Mellon University","host_organization_lineage":["https://openalex.org/I74973139"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Dissertations","raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G3269144072","display_name":"DC: Medium: Designing and Programming a Low-Power Cluster Architecture for Data-Intensive Workloads","funder_award_id":"0964474","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4702511812","display_name":"CAREER:    Algorithmic Theory and Applications of Metric Emeddings","funder_award_id":"0448095","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7854016737","display_name":"Collaborative Research: Emerging Directions in Network Design and Optimization","funder_award_id":"0729022","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320310207","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2139235151.pdf","grobid_xml":"https://content.openalex.org/works/W2139235151.grobid-xml"},"referenced_works_count":90,"referenced_works":["https://openalex.org/W133323552","https://openalex.org/W1480622138","https://openalex.org/W1482405521","https://openalex.org/W1521693993","https://openalex.org/W1569990960","https://openalex.org/W1590399153","https://openalex.org/W1603341341","https://openalex.org/W1605676990","https://openalex.org/W1788659242","https://openalex.org/W1825072153","https://openalex.org/W1843157236","https://openalex.org/W1968690018","https://openalex.org/W1973081829","https://openalex.org/W1974114807","https://openalex.org/W1978086920","https://openalex.org/W1981114903","https://openalex.org/W1981673685","https://openalex.org/W1983758874","https://openalex.org/W1984290406","https://openalex.org/W1985942708","https://openalex.org/W1986011879","https://openalex.org/W1989224473","https://openalex.org/W1996837595","https://openalex.org/W2000793193","https://openalex.org/W2001139415","https://openalex.org/W2001729421","https://openalex.org/W2002285507","https://openalex.org/W2006618115","https://openalex.org/W2009617375","https://openalex.org/W2011039300","https://openalex.org/W2011538677","https://openalex.org/W2011823863","https://openalex.org/W2014071862","https://openalex.org/W2016377267","https://openalex.org/W2021185572","https://openalex.org/W2025702744","https://openalex.org/W2029437526","https://openalex.org/W2037408498","https://openalex.org/W2037666581","https://openalex.org/W2040774021","https://openalex.org/W2041025394","https://openalex.org/W2041075508","https://openalex.org/W2044081853","https://openalex.org/W2052687843","https://openalex.org/W2055155874","https://openalex.org/W2057974767","https://openalex.org/W2058267344","https://openalex.org/W2060807538","https://openalex.org/W2068637807","https://openalex.org/W2078501279","https://openalex.org/W2078850190","https://openalex.org/W2082353536","https://openalex.org/W2083459869","https://openalex.org/W2089867501","https://openalex.org/W2092795460","https://openalex.org/W2096881311","https://openalex.org/W2098432798","https://openalex.org/W2099338166","https://openalex.org/W2102132526","https://openalex.org/W2102201348","https://openalex.org/W2106554316","https://openalex.org/W2110681594","https://openalex.org/W2112058494","https://openalex.org/W2113939799","https://openalex.org/W2114493937","https://openalex.org/W2119840952","https://openalex.org/W2121085314","https://openalex.org/W2122967269","https://openalex.org/W2123016239","https://openalex.org/W2132620463","https://openalex.org/W2133997119","https://openalex.org/W2138536745","https://openalex.org/W2140844111","https://openalex.org/W2143863355","https://openalex.org/W2147954430","https://openalex.org/W2149272173","https://openalex.org/W2151239055","https://openalex.org/W2152124311","https://openalex.org/W2155053834","https://openalex.org/W2158591664","https://openalex.org/W2160770200","https://openalex.org/W2167621755","https://openalex.org/W2172955861","https://openalex.org/W2178484001","https://openalex.org/W2184658490","https://openalex.org/W2331310731","https://openalex.org/W2408747761","https://openalex.org/W2502170570","https://openalex.org/W2594014086","https://openalex.org/W2896902984"],"related_works":["https://openalex.org/W2281909915","https://openalex.org/W2125295283","https://openalex.org/W6941097277","https://openalex.org/W7098078094","https://openalex.org/W7097662630","https://openalex.org/W7097392126","https://openalex.org/W1566903869","https://openalex.org/W7099114910","https://openalex.org/W6941163331","https://openalex.org/W2299935480"],"abstract_inverted_index":{"The":[0,157],"focus":[1,153],"of":[2,11,22,32,92,113,127,154,177],"this":[3,75,155,163,271],"thesis":[4,164],"is":[5,29,64,69,76,83,151,180],"on":[6,226],"the":[7,35,66,78,86,89,132,145,152,166,169,175,188,198,203,213,218,242,253,263],"design":[8],"and":[9,95,141,210,237,258],"analysis":[10],"algorithms":[12,51,63,108,239],"for":[13,107,134,147,195,233,240],"basic":[14],"problems":[15,26,41,159,236,244],"in":[16,34,61,71,85,162,265,270],"Stochastic":[17,189,214],"Optimization,":[18],"specifically":[19],"a":[20,58,184,227],"class":[21],"fundamental":[23],"combinatorial":[24],"optimization":[25,40],"where":[27,174,202,217],"there":[28,82],"some":[30],"form":[31],"uncertainty":[33,84],"input.":[36],"Since":[37],"many":[38,126],"interesting":[39],"are":[42,119,165,221,255,268],"computationally":[43],"intractable":[44],"(NP-Hard),":[45],"we":[46,160],"resort":[47],"to":[48,109,123],"designing":[49],"approximation":[50,247],"which":[52,266],"provably":[53],"output":[54],"good":[55],"solutions.":[56],"However,":[57],"common":[59],"assumption":[60],"traditional":[62],"that":[65,252],"exact":[67,158],"input":[68,93,114],"known":[70,185],"advance.":[72],"What":[73,80],"if":[74,81],"not":[77,120],"case?":[79],"input?":[87],"With":[88],"growing":[90],"size":[91],"data":[94],"their":[96],"typically":[97],"distributed":[98],"nature":[99],"(e.g.,":[100],"cloud":[101],"computing),":[102],"it":[103],"has":[104],"become":[105],"imperative":[106],"handle":[110],"varying":[111],"forms":[112],"uncertainty.":[115],"Current":[116],"techniques,":[117],"however,":[118],"robust":[121],"enough":[122],"deal":[124],"with":[125,192,245],"these":[128,235],"problems,":[129,150],"thus":[130],"necessitating":[131],"need":[133],"new":[135],"algorithmic":[136],"tools.":[137],"Answering":[138],"such":[139,149],"questions,":[140],"more":[142],"generally":[143],"identifying":[144],"tools":[146],"solving":[148,234],"thesis.":[156,272],"study":[161],"following:":[167],"(a)":[168],"Survivable":[170],"Network":[171],"Design":[172],"problem":[173,191],"collection":[176],"(source,sink)":[178],"pairs":[179],"drawn":[181],"randomly":[182],"from":[183],"distribution,":[186],"(b)":[187],"Knapsack":[190],"random":[193,208,219],"sizes/rewards":[194],"jobs,":[196],"(c)":[197],"Multi-Armed":[199],"Bandits":[200],"problem,":[201,216],"individual":[204],"Markov":[205],"Chains":[206],"make":[207],"transitions,":[209],"finally":[211],"(d)":[212],"Orienteering":[215],"tasks/jobs":[220],"located":[222],"at":[223],"different":[224,231],"vertices":[225],"metric.":[228],"We":[229,249],"explore":[230],"techniques":[232,254],"present":[238],"all":[241],"above":[243],"near-optimal":[246],"guarantees.":[248],"also":[250],"believe":[251],"fairly":[256],"general":[257],"have":[259],"wider":[260],"applicability":[261],"than":[262],"context":[264],"they":[267],"used":[269]},"counts_by_year":[],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}