{"id":"https://openalex.org/W3095065183","doi":"https://doi.org/10.1007/s10107-022-01777-9","title":"Approximating the discrete time-cost tradeoff problem with bounded depth","display_name":"Approximating the discrete time-cost tradeoff problem with bounded depth","publication_year":2022,"publication_date":"2022-02-11","ids":{"openalex":"https://openalex.org/W3095065183","doi":"https://doi.org/10.1007/s10107-022-01777-9","mag":"3095065183"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-022-01777-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-022-01777-9.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10107-022-01777-9.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035842055","display_name":"Siad Daboul","orcid":"https://orcid.org/0000-0002-5864-9385"},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"funder","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Siad Daboul","raw_affiliation_strings":["Research Institute for Discrete Mathematics and Hausdorff Center for Mathematics, University of Bonn, Bonn, Germany"],"affiliations":[{"raw_affiliation_string":"Research Institute for Discrete Mathematics and Hausdorff Center for Mathematics, University of Bonn, Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089221320","display_name":"Stephan Held","orcid":"https://orcid.org/0000-0003-2188-1559"},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"funder","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stephan Held","raw_affiliation_strings":["Research Institute for Discrete Mathematics and Hausdorff Center for Mathematics, University of Bonn, Bonn, Germany"],"affiliations":[{"raw_affiliation_string":"Research Institute for Discrete Mathematics and Hausdorff Center for Mathematics, University of Bonn, Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028076811","display_name":"Jens Vygen","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"funder","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jens Vygen","raw_affiliation_strings":["Research Institute for Discrete Mathematics and Hausdorff Center for Mathematics, University of Bonn, Bonn, Germany"],"affiliations":[{"raw_affiliation_string":"Research Institute for Discrete Mathematics and Hausdorff Center for Mathematics, University of Bonn, Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2190,"currency":"EUR","value_usd":2890},"fwci":0.351,"has_fulltext":true,"fulltext_origin":"pdf","cited_by_count":2,"citation_normalized_percentile":{"value":0.586975,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":69,"max":75},"biblio":{"volume":"197","issue":"2","first_page":"529","last_page":"547"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9975,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5855655},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.55888826}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6751303},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5855655},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.55947715},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.55888826},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.52795184},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.52492934},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.46272957},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.45662937},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4352964},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42932397},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.41004115},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3634867},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1796684},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10026777},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-022-01777-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-022-01777-9.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-022-01777-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-022-01777-9.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.55}],"grants":[{"funder":"https://openalex.org/F4320324900","funder_display_name":"Rheinische Friedrich-Wilhelms-Universit\u00e4t Bonn","award_id":null}],"datasets":[],"versions":[],"referenced_works_count":22,"referenced_works":["https://openalex.org/W1515077583","https://openalex.org/W1989540884","https://openalex.org/W2012329067","https://openalex.org/W2012391569","https://openalex.org/W2035871154","https://openalex.org/W2048411223","https://openalex.org/W2052790720","https://openalex.org/W2064600658","https://openalex.org/W2070576097","https://openalex.org/W2091481536","https://openalex.org/W2117372120","https://openalex.org/W2123068254","https://openalex.org/W2134435031","https://openalex.org/W2137118456","https://openalex.org/W2139411793","https://openalex.org/W2143698439","https://openalex.org/W2149342630","https://openalex.org/W2150973769","https://openalex.org/W2163318198","https://openalex.org/W2461695593","https://openalex.org/W3014552119","https://openalex.org/W4205775998"],"related_works":["https://openalex.org/W2777980911","https://openalex.org/W2551034790","https://openalex.org/W2115404728","https://openalex.org/W2100782222","https://openalex.org/W2096382750","https://openalex.org/W2056597184","https://openalex.org/W2029933769","https://openalex.org/W1712180277","https://openalex.org/W1608414128","https://openalex.org/W159504299"],"abstract_inverted_index":{"Abstract":[0],"We":[1,47,183],"revisit":[2],"the":[3,7,13,33,55,61,84,186,211,240],"deadline":[4],"version":[5],"of":[6,16,29,35,70,113,116,233],"discrete":[8],"time-cost":[9,99,174,250],"tradeoff":[10,100,175,251],"problem":[11,62],"for":[12,22,95,140,148,172,248,261],"special":[14,68],"case":[15,69],"bounded":[17,262],"depth.":[18,263],"Such":[19],"instances":[20,252],"occur":[21],"example":[23],"in":[24,37,76,92,107,144],"VLSI":[25],"design.":[26],"The":[27],"depth":[28],"an":[30,103],"instance":[31],"is":[32,42,156,180,208],"number":[34],"jobs":[36],"a":[38,67,72,77,123,161,231],"longest":[39],"chain":[40],"and":[41,51,115,119,151,158,188,215],"denoted":[43],"by":[44],"d":[45,78,97,145,150,153,179],".":[46,228],"prove":[48],"new":[49],"upper":[50],"lower":[52],"bounds":[53],"on":[54,110],"approximability.":[56],"First":[57],"we":[58,82,121],"observe":[59],"that":[60,190,238],"can":[63,89],"be":[64,90],"regarded":[65],"as":[66],"finding":[71],"minimum-weight":[73,141],"vertex":[74,142],"cover":[75,143],"-partite":[79,146],"hypergraph.":[80],"Next,":[81],"study":[83,185],"natural":[85],"LP":[86],"relaxation,":[87],"which":[88],"solved":[91],"polynomial":[93],"time":[94],"fixed":[96,149],"and\u2014for":[98],"instances\u2014up":[101],"to":[102],"arbitrarily":[104],"small":[105],"error":[106],"general.":[108],"Improving":[109],"prior":[111],"work":[112],"Lov\u00e1sz":[114],"Aharoni,":[117],"Holzman":[118],"Krivelevich,":[120],"describe":[122],"deterministic":[124],"algorithm":[125,171,246],"with":[126],"approximation":[127,193,245],"ratio":[128,194],"slightly":[129],"less":[130],"than":[131,195],"$$\\frac{d}{2}$$":[132,162],"":[134,164,198,221],"":[135,165,199],"d":[136,166,201],"2":[137,167,203],"":[138,168,206],"":[139,169,207,227],"hypergraphs":[147],"given":[152],"-partition.":[154],"This":[155,229],"tight":[157],"yields":[159],"also":[160,184],"-approximation":[170],"general":[173,249],"instances,":[176],"even":[177],"if":[178],"not":[181],"fixed.":[182],"inapproximability":[187],"show":[189],"no":[191,243],"better":[192],"$$\\frac{d+2}{4}$$":[196],"":[200,222],"+":[202],"":[204,226],"4":[205],"possible,":[209],"assuming":[210],"Unique":[212],"Games":[213],"Conjecture":[214],"$$\\text":[216],"{P}\\ne":[217],"\\text":[218],"{NP}$$":[219],"P":[223],"\u2260":[224],"NP":[225],"strengthens":[230],"result":[232],"Svensson":[234],"[21],":[235],"who":[236],"showed":[237],"under":[239],"same":[241],"assumptions":[242],"constant-factor":[244],"exists":[247],"(of":[253],"unbounded":[254],"depth).":[255],"Previously,":[256],"only":[257],"APX-hardness":[258],"was":[259],"known":[260]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W3095065183","counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-04-24T16:14:24.953421","created_date":"2020-11-09"}