{"id":"https://openalex.org/W3090692263","doi":"https://doi.org/10.1137/19m1244512","title":"Constant factor approximation algorithm for weighted flow-time on a single machine in pseudopolynomial time","display_name":"Constant factor approximation algorithm for weighted flow-time on a single machine in pseudopolynomial time","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W3090692263","doi":"https://doi.org/10.1137/19m1244512","mag":"3090692263"},"language":"en","primary_location":{"id":"pmh:oai:cwi.nl:33883","is_oa":false,"landing_page_url":"https://ir.cwi.nl/pub/33883","pdf_url":null,"source":{"id":"https://openalex.org/S7407055335","display_name":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing vol. 52 no. 6, pp. FOCS18158-FOCS18188","raw_type":"info:eu-repo/semantics/article"},"type":"article","indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Batra, J. (Jatin)","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Batra, J. (Jatin)","raw_affiliation_strings":["Department of Computer Science and Engineering IIT Delhi"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering IIT Delhi","institution_ids":[]}]},{"author_position":"middle","author":{"id":null,"display_name":"Garg, N. (Naveen)","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Garg, N. (Naveen)","raw_affiliation_strings":["Department of Computer Science and Engineering IIT Delhi"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering IIT Delhi","institution_ids":[]}]},{"author_position":"last","author":{"id":null,"display_name":"Kumar, A. (Amit)","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kumar, A. (Amit)","raw_affiliation_strings":["Department of Computer Science and Engineering IIT Delhi"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering IIT Delhi","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3509,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.54812359,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"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/T12288","display_name":"Optimization and Search Problems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9959999918937683,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5979646444320679},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5869379043579102},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5558282136917114},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5336716175079346},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5312416553497314},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5226730704307556},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.5205793976783752},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5018801689147949},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.49715927243232727},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4826982021331787},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4569757878780365},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.43596553802490234},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.41924038529396057},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41169536113739014},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.21933960914611816}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5979646444320679},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5869379043579102},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5558282136917114},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5336716175079346},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5312416553497314},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5226730704307556},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5205793976783752},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5018801689147949},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.49715927243232727},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4826982021331787},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4569757878780365},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.43596553802490234},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.41924038529396057},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41169536113739014},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.21933960914611816},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:cwi.nl:33883","is_oa":false,"landing_page_url":"https://ir.cwi.nl/pub/33883","pdf_url":null,"source":{"id":"https://openalex.org/S7407055335","display_name":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing vol. 52 no. 6, pp. FOCS18158-FOCS18188","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.7200000286102295}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1574334008","https://openalex.org/W1902458841","https://openalex.org/W1970286891","https://openalex.org/W1972868674","https://openalex.org/W1986685589","https://openalex.org/W2003902046","https://openalex.org/W2019062750","https://openalex.org/W2020082371","https://openalex.org/W2069466073","https://openalex.org/W2086365412","https://openalex.org/W2134553994","https://openalex.org/W2166867051","https://openalex.org/W2570727021","https://openalex.org/W2743045177","https://openalex.org/W2952691133","https://openalex.org/W2962679017","https://openalex.org/W4241195282","https://openalex.org/W4247793956","https://openalex.org/W4254087392"],"related_works":["https://openalex.org/W3035974271","https://openalex.org/W3141113327","https://openalex.org/W3161514703","https://openalex.org/W3023146478","https://openalex.org/W4206915070","https://openalex.org/W2080904092","https://openalex.org/W1994440468","https://openalex.org/W1560003866","https://openalex.org/W2952996388","https://openalex.org/W2186707160"],"abstract_inverted_index":{"In":[0],"the":[1,41,49,55,67,83,87,103,111,114,117,138,146,162,171,226,229],"weighted":[2,44,91,181],"flow-time":[3,45,50,182],"problem":[4,84,133,140,165,183],"on":[5,127,141,166,198,206],"a":[6,12,21,36,52,122,128,135,156],"single":[7],"machine,":[8],"we":[9,144,152,168,191,220],"are":[10,192,210],"given":[11],"set":[13],"of":[14,43,46,51,85,90,96,105,113,121,131,137,174,228],"n":[15],"jobs,":[16,47,106],"where":[17,48],"each":[18],"job":[19,53],"has":[20],"processing":[22,119],"requirement":[23,120],"pj,":[24],"release":[25],"date":[26],"rj,":[27],"and":[28,61,107,190,219],"weight":[29],"wj.":[30],"The":[31,77,93],"goal":[32],"is":[33,54,99,110],"to":[34,82,116,134,194,224],"find":[35],"preemptive":[37],"schedule":[38],"which":[39,109,143,214],"minimizes":[40],"sum":[42],"difference":[56],"between":[57],"its":[58,62],"completion":[59],"time":[60,70,95],"released":[63],"date.":[64],"We":[65],"give":[66,155],"first":[68],"pseudopolynomial":[69],"constant":[71,157],"approximation":[72,159],"algorithm":[73,78,98,125,160,204],"for":[74,161],"this":[75,132],"problem.":[76,149],"also":[79],"extends":[80],"directly":[81],"minimizing":[86],"\u2113p":[88],"norm":[89],"flow-times.":[92],"running":[94],"our":[97],"polynomial":[100],"in":[101,188],"n,":[102],"number":[104],"P,":[108],"ratio":[112],"largest":[115],"smallest":[118],"job.":[123],"Our":[124,201],"relies":[126,205],"novel":[129],"reduction":[130,179],"generalization":[136],"multicut":[139],"trees,":[142,167],"call":[145],"Demand":[147,163,175],"MultiCut":[148,164,176],"Even":[150],"though":[151],"do":[153],"not":[154],"factor":[158],"show":[169],"that":[170,208],"specific":[172],"instances":[173,184],"obtained":[177],"by":[178],"from":[180],"have":[185,215],"more":[186],"structure":[187],"them,":[189],"able":[193],"employ":[195],"techniques":[196],"based":[197],"dynamic":[199,202,230],"programming.":[200],"programming":[203,231],"showing":[207],"there":[209],"near":[211],"optimal":[212],"solutions":[213],"nice":[216],"smoothness":[217],"properties,":[218],"exploit":[221],"these":[222],"properties":[223],"reduce":[225],"size":[227],"table.":[232]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-06-01T06:10:38.934834","created_date":"2025-10-10T00:00:00"}