{"id":"https://openalex.org/W6910571582","doi":"https://doi.org/10.48693/450","title":"Approximation Algorithms for Multistage Subgraph Problems","display_name":"Approximation Algorithms for Multistage Subgraph Problems","publication_year":2024,"publication_date":"2024-01-17","ids":{"openalex":"https://openalex.org/W6910571582","doi":"https://doi.org/10.48693/450"},"language":"en","primary_location":{"id":"doi:10.48693/450","is_oa":true,"landing_page_url":"https://doi.org/10.48693/450","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"type":"other","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.48693/450","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Troost, Niklas Johannes","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Troost, Niklas Johannes","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"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":true,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5037000179290771},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.4652999937534332},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.45239999890327454},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.446399986743927},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.42160001397132874},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.376800000667572},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.3709000051021576},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.37049999833106995}],"concepts":[{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5037000179290771},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46799999475479126},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.4652999937534332},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.45239999890327454},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.446399986743927},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4325999915599823},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.42160001397132874},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41359999775886536},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39730000495910645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38440001010894775},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.376800000667572},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.3709000051021576},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.37049999833106995},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.36399999260902405},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3603000044822693},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3569999933242798},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.29179999232292175},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.2721000015735626},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.2587999999523163},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.2574999928474426},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.25369998812675476},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.2526000142097473}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48693/450","is_oa":true,"landing_page_url":"https://doi.org/10.48693/450","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"doi:10.48693/450","is_oa":true,"landing_page_url":"https://doi.org/10.48693/450","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,97,188],"concepts":[1],"of":[2,16,51,72,77,88,111,134,143,155,202,205,214,227,231,246,261,268,273,283],"classical":[3,160,206],"graph":[4,53,91,130,209],"theory":[5],"offer":[6],"a":[7,23,103,109,170,199,278],"framework":[8],"for":[9,127,191,297],"modeling":[10],"problems":[11,35,73,177,207,215],"from":[12],"almost":[13],"all":[14],"areas":[15],"life.":[17],"Temporal":[18],"graphs":[19,78,112,136],"in":[20,95,208,287],"particular":[21],"provide":[22],"way":[24],"to":[25,34,46,83,101,196,198,294],"represent":[26],"and":[27,131,179,184,239,271,310,321,331],"analyze":[28],"dynamic":[29],"data,":[30,48],"enabling":[31],"algorithmic":[32,189],"solutions":[33,133],"dealing":[36],"with":[37,307],"structures":[38],"that":[39,114],"change":[40],"over":[41],"time.":[42,96,323],"For":[43,173],"the":[44,52,60,66,70,89,115,159,174,219,225,228,236,259,269,281,284,298,338],"extension":[45],"time-related":[47],"different":[49,93],"modifications":[50],"concept":[54],"can":[55,193,252],"be":[56,84,194,253],"useful,":[57],"depending":[58],"on":[59,69,74,108,216,327],"optimization":[61,106],"goal.":[62],"In":[63,277],"this":[64,144,232,264],"work,":[65],"focus":[67,226],"is":[68,100,125,165,224,289,305],"analysis":[71],"finite":[75],"sequences":[76],"whose":[79],"sequence":[80,110,118],"members":[81],"are":[82,137,147,186],"read":[85],"as":[86,138,140],"snapshots":[87],"same":[90],"at":[92],"points":[94],"key":[98],"topic":[99],"solve":[102],"given":[104],"combinatorial":[105],"problem":[107,162],"such":[113,169,274],"resulting":[116,176],"solution":[117,124,319],"satisfies":[119],"two":[120,175],"conditions:":[121],"(i)":[122],"each":[123,262],"optimal":[126],"its":[128],"respective":[129,318],"(ii)":[132],"successive":[135],"similar":[139],"possible.":[141],"Problems":[142],"abstract":[145],"form":[146],"called":[148],"multistage":[149,171,203,217,275],"problems,":[150],"since":[151],"their":[152,317],"instances":[153,296],"consist":[154],"multiple":[156],"stages.":[157],"First,":[158],"assignment":[161],"Maximum":[163],"Matching":[164],"exemplarily":[166],"transferred":[167],"into":[168],"setting.":[172],"MIM":[178,192],"MUM,":[180],"various":[181],"approximation":[182,285],"algorithms":[183,251,286],"reductions":[185],"developed.":[187],"approaches":[190],"generalized":[195],"apply":[197],"broad":[200],"class":[201,213],"formulations":[204],"theory.":[210],"This":[211],"general":[212],"graphs,":[218],"so-called":[220],"Multistage":[221,299,328,332],"Subgraph":[222],"Problems,":[223],"second":[229],"part":[230],"thesis.":[233,339],"After":[234],"discussing":[235],"corresponding":[237],"definitions":[238],"adapted":[240,250],"algorithms,":[241],"we":[242,256],"present":[243],"numerous":[244],"examples":[245],"MSPs,":[247],"where":[248],"these":[249],"applied.":[254],"As":[255],"also":[257],"study":[258],"complexity":[260],"example,":[263],"provides":[265],"an":[266,311],"overview":[267],"similarities":[270],"differences":[272],"problems.":[276],"third":[279],"part,":[280],"performance":[282],"practice":[288],"investigated":[290],"by":[291],"applying":[292],"them":[293],"example":[295],"Shortest":[300,329],"Path":[301,330],"problem.":[302],"A":[303],"comparison":[304],"made":[306],"derived":[308],"heuristics":[309],"exact":[312],"(but":[313],"slow)":[314],"algorithm,":[315],"investigating":[316],"quality":[320],"running":[322],"Additional":[324],"problem-specific":[325],"results":[326],"Minimum":[333],"Weight":[334],"Spanning":[335],"Tree":[336],"complete":[337]},"counts_by_year":[],"updated_date":"2026-07-23T05:56:39.545243","created_date":"2025-10-10T00:00:00"}