{"id":"https://openalex.org/W2954240202","doi":"https://doi.org/10.1145/3323165.3323174","title":"Fast Distributed Algorithms for LP-Type Problems of Bounded Dimension (Brief Announcement)","display_name":"Fast Distributed Algorithms for LP-Type Problems of Bounded Dimension (Brief Announcement)","publication_year":2019,"publication_date":"2019-06-17","ids":{"openalex":"https://openalex.org/W2954240202","doi":"https://doi.org/10.1145/3323165.3323174","mag":"2954240202"},"language":"en","primary_location":{"id":"doi:10.1145/3323165.3323174","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3323165.3323174","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 31st ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-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/A5076271633","display_name":"Kristian Hinnenthal","orcid":"https://orcid.org/0000-0001-9464-295X"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Kristian Hinnenthal","raw_affiliation_strings":["Paderborn University, Paderborn, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Paderborn University, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063355098","display_name":"Christian Scheideler","orcid":"https://orcid.org/0000-0002-5278-528X"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Scheideler","raw_affiliation_strings":["Paderborn University, Paderborn, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Paderborn University, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001644472","display_name":"Martijn Struijs","orcid":"https://orcid.org/0000-0002-0116-7238"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Martijn Struijs","raw_affiliation_strings":["TU Eindhoven, Eindhoven, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Eindhoven, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3719,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.63951588,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"393","last_page":"394"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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.9998000264167786,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9987999796867371,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/gossip","display_name":"Gossip","score":0.8842196464538574},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.6150688529014587},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.6098266839981079},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.562523603439331},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5275257229804993},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5237441062927246},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.4979429244995117},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.48952946066856384},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.46336647868156433},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.4537232220172882},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4525175094604492},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.45106178522109985},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4490639567375183},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.43951475620269775},{"id":"https://openalex.org/keywords/ball","display_name":"Ball (mathematics)","score":0.4255870580673218},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.42331647872924805},{"id":"https://openalex.org/keywords/covering-problems","display_name":"Covering problems","score":0.41292357444763184},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.41031041741371155},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41028526425361633},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34268322587013245},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.13238206505775452}],"concepts":[{"id":"https://openalex.org/C62989814","wikidata":"https://www.wikidata.org/wiki/Q854648","display_name":"Gossip","level":2,"score":0.8842196464538574},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.6150688529014587},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.6098266839981079},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.562523603439331},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5275257229804993},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5237441062927246},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4979429244995117},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.48952946066856384},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.46336647868156433},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.4537232220172882},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4525175094604492},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.45106178522109985},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4490639567375183},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.43951475620269775},{"id":"https://openalex.org/C122041747","wikidata":"https://www.wikidata.org/wiki/Q838611","display_name":"Ball (mathematics)","level":2,"score":0.4255870580673218},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.42331647872924805},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.41292357444763184},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.41031041741371155},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41028526425361633},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34268322587013245},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.13238206505775452},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/3323165.3323174","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3323165.3323174","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 31st ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/6d918454-2e3f-472e-a793-c752780f2ac8","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/6d918454-2e3f-472e-a793-c752780f2ac8","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Hinnenthal, K, Scheideler, C & Struijs, M 2019, Fast distributed algorithms for LP-Type problems of bounded dimension (brief announcement). in SPAA 2019 - Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, Inc., New York, pp. 393-394, 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, United States, 22/06/19. https://doi.org/10.1145/3323165.3323174","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:912602","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=912602","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":"","raw_type":""},{"id":"pmh:oai:library.tue.nl:912602","is_oa":false,"landing_page_url":"http://repository.tue.nl/912602","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":"","raw_type":""},{"id":"pmh:tue:oai:pure.tue.nl:publications/6d918454-2e3f-472e-a793-c752780f2ac8","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/6d918454-2e3f-472e-a793-c752780f2ac8","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SPAA 2019 - Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, 393 - 394","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8026673714","display_name":null,"funder_award_id":"SFB 901","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W2942048573","https://openalex.org/W2954240202"],"related_works":["https://openalex.org/W2113943781","https://openalex.org/W2358533445","https://openalex.org/W2044818254","https://openalex.org/W2790735614","https://openalex.org/W2075346653","https://openalex.org/W1986685589","https://openalex.org/W4229873764","https://openalex.org/W2108073487","https://openalex.org/W1930431538","https://openalex.org/W2952019673"],"abstract_inverted_index":{"In":[0,50],"this":[1],"brief":[2],"announcement":[3],"we":[4],"summarize":[5],"our":[6],"results":[7],"concerning":[8],"distributed":[9],"algorithms":[10,94],"for":[11,71],"LP-type":[12,19,118,129],"problems":[13,20,26,33,43],"in":[14,134],"the":[15,51,72,112,116,124,127,135],"well-known":[16],"gossip":[17,52,73],"model.":[18],"include":[21],"many":[22],"important":[23],"classes":[24],"of":[25,115,126,137],"such":[27],"as":[28],"(integer)":[29],"linear":[30],"programming,":[31],"geometric":[32],"like":[34,44],"smallest":[35],"enclosing":[36],"ball":[37],"and":[38,41,47,86,91],"polytope":[39],"distance,":[40],"set":[42,46,48],"hitting":[45],"cover.":[49],"model,":[53],"a":[54],"node":[55,108],"can":[56],"only":[57],"push":[58],"information":[59,63],"to":[60,80],"or":[61,100],"pull":[62],"from":[64],"nodes":[65],"chosen":[66],"uniformly":[67],"at":[68],"random.":[69],"Protocols":[70],"model":[74],"are":[75,95],"usually":[76],"very":[77,96],"practical":[78],"due":[79],"their":[81,84,87],"fast":[82],"convergence,":[83],"simplicity,":[85],"stability":[88],"under":[89],"stress":[90],"disruptions.":[92],"Our":[93],"efficient":[97],"(logarithmic":[98],"rounds":[99],"better":[101],"with":[102],"just":[103],"polylogarithmic":[104],"communication":[105],"work":[106],"per":[107,109],"round)":[110],"whenever":[111],"combinatorial":[113],"dimension":[114],"given":[117,128],"problem":[119,130],"is":[120,131],"constant,":[121],"even":[122],"if":[123],"size":[125],"polynomially":[132],"large":[133],"number":[136],"nodes.":[138]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}