{"id":"https://openalex.org/W1975201766","doi":"https://doi.org/10.1145/2421119.2421142","title":"SIGACT news online algorithms column 21","display_name":"SIGACT news online algorithms column 21","publication_year":2012,"publication_date":"2012-12-19","ids":{"openalex":"https://openalex.org/W1975201766","doi":"https://doi.org/10.1145/2421119.2421142","mag":"1975201766"},"language":"en","primary_location":{"id":"doi:10.1145/2421119.2421142","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2421119.2421142","pdf_url":null,"source":{"id":"https://openalex.org/S4210206003","display_name":"ACM SIGACT News","issn_l":"0163-5700","issn":["0163-5700","1943-5827"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGACT News","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070193017","display_name":"Rob van Stee","orcid":"https://orcid.org/0000-0002-3664-0865"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Rob van Stee","raw_affiliation_strings":["Max Planck Institute for Informatics, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5070193017"],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.09092396,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"43","issue":"4","first_page":"123","last_page":"129"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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":0.9997000098228455,"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.998199999332428,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9839000105857849,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/column","display_name":"Column (typography)","score":0.7260143160820007},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7085397839546204},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5588191747665405},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5161698460578918},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46825700998306274},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.45686858892440796},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1831081211566925},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.15081346035003662},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.13102415204048157}],"concepts":[{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.7260143160820007},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7085397839546204},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5588191747665405},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5161698460578918},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46825700998306274},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.45686858892440796},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1831081211566925},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.15081346035003662},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.13102415204048157},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2421119.2421142","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2421119.2421142","pdf_url":null,"source":{"id":"https://openalex.org/S4210206003","display_name":"ACM SIGACT News","issn_l":"0163-5700","issn":["0163-5700","1943-5827"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGACT News","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.6600000262260437,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W123039402","https://openalex.org/W186360080","https://openalex.org/W1470213731","https://openalex.org/W1736299573","https://openalex.org/W1810505368","https://openalex.org/W1916550914","https://openalex.org/W1966527086","https://openalex.org/W1980135493","https://openalex.org/W1987801757","https://openalex.org/W2046446291","https://openalex.org/W2055364146","https://openalex.org/W2163017071","https://openalex.org/W2176610120","https://openalex.org/W2177689085"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2181722423","https://openalex.org/W2347222412","https://openalex.org/W2085601491","https://openalex.org/W2375996887","https://openalex.org/W4322723290","https://openalex.org/W2053286651","https://openalex.org/W2368976073","https://openalex.org/W1970915793"],"abstract_inverted_index":{"For":[0],"this":[1],"column,":[2],"I":[3,12,77],"would":[4],"like":[5],"to":[6,21,80],"report":[7],"on":[8],"some":[9],"conferences":[10],"that":[11],"attended":[13],"recently,":[14],"with":[15],"special":[16],"attention":[17],"given":[18],"(of":[19],"course)":[20],"results":[22],"in":[23],"online":[24,33],"algorithms.":[25],"Most":[26],"of":[27,39],"the":[28,74],"papers":[29],"discussed":[30],"below":[31],"consider":[32],"scheduling,":[34],"another":[35],"favorite":[36],"problem":[37],"area":[38],"mine.":[40],"Generally,":[41],"for":[42],"a":[43],"job":[44],"j":[45],"we":[46],"will":[47],"denote":[48],"its":[49,55,61,68],"processing":[50],"time":[51,63],"by":[52,57,64,70],"pj":[53],",":[54,66],"weight":[56],"wj":[58],"(if":[59],"applicable),":[60],"release":[62],"rj":[65],"and":[67],"deadline":[69],"dj":[71],".":[72],"In":[73],"discussion":[75],"below,":[76],"have":[78],"tried":[79],"point":[81],"out":[82],"interesting":[83],"open":[84],"problems":[85],"wherever":[86],"possible.":[87],"Enjoy.":[88]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}