{"id":"https://openalex.org/W247937228","doi":null,"title":"Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization.","display_name":"Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization.","alternate_titles":[],"publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W247937228","mag":"247937228"},"language":"en","primary_location":{"id":"mag:247937228","doi":null,"is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/conf/pdcn/pdcn2004.html#Abu-KhzamLS04","pdf_url":null,"source":{"id":"https://openalex.org/S2764346294","display_name":"Parallel and distributed computing and networks","issn_l":"1925-5543","issn":["1925-5543","1925-5535"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Parallel and distributed computing and networks","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W247937228"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5090561191","display_name":"Faisal N. Abu-Khzam","orcid":"https://orcid.org/0000-0001-5221-8421","observed_orcids":["https://orcid.org/0000-0001-5221-8421"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Faisal N. Abu-Khzam","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-5221-8421","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011863644","display_name":"Michael Allen Langston","orcid":"https://orcid.org/0000-0001-5945-5796","observed_orcids":["https://orcid.org/0000-0001-5945-5796"]},"institutions":[{"id":"https://openalex.org/I75027704","display_name":"University of Tennessee at Knoxville","ror":"https://ror.org/020f3ap87","country_code":"US","type":"education","lineage":["https://openalex.org/I75027704"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Michael A. Langston","raw_affiliation_strings":["#N##TAB##TAB##TAB##TAB# University of Tennessee#N##TAB##TAB##TAB#"],"raw_orcid":"https://orcid.org/0000-0001-5945-5796","affiliations":[{"raw_affiliation_string":"#N##TAB##TAB##TAB##TAB# University of Tennessee#N##TAB##TAB##TAB#","institution_ids":["https://openalex.org/I75027704"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044265180","display_name":"Pushkar Shanbhag","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Pushkar Shanbhag","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.6381,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.9036677,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":86,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"649","last_page":"654"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7074999809265137,"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":0.7074999809265137,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.10109999775886536,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.07000000029802322,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/parallel-algorithms","display_name":"parallel algorithms","score":0.9350000023841858},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.9750000238418579},{"id":"https://openalex.org/keywords/vertex-cover-problem","display_name":"vertex cover","score":0.7850000262260437},{"id":"https://openalex.org/keywords/np-hard-problems","display_name":"NP-hard problems","score":0.9850000143051147},{"id":"https://openalex.org/keywords/scalable-computing","display_name":"scalable computing","score":0.5080000162124634},{"id":"https://openalex.org/keywords/large-scale-optimization","display_name":"large-scale optimization","score":0.6079999804496765}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8525505661964417},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.8089141845703125},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5573009252548218},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5178573131561279},{"id":"https://openalex.org/C115908005","wikidata":"https://www.wikidata.org/wiki/Q2668364","display_name":"Combinatorial explosion","level":2,"score":0.515247642993927},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4750409424304962},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4499009847640991},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.4114293158054352},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37694135308265686},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2571650743484497},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10451722145080566},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:247937228","doi":null,"is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/conf/pdcn/pdcn2004.html#Abu-KhzamLS04","pdf_url":null,"source":{"id":"https://openalex.org/S2764346294","display_name":"Parallel and distributed computing and networks","issn_l":"1925-5543","issn":["1925-5543","1925-5535"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Parallel and distributed computing and networks","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.5.3113","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.3113","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utk.edu/~langston/projects/papers/scalable.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W49914270","https://openalex.org/W62617392","https://openalex.org/W1972845596","https://openalex.org/W1973852671","https://openalex.org/W1987092466","https://openalex.org/W2000611521","https://openalex.org/W2007979101","https://openalex.org/W2013415302","https://openalex.org/W2043344835","https://openalex.org/W2089688060","https://openalex.org/W2913688336"],"related_works":["https://openalex.org/W7100680524","https://openalex.org/W2020681752","https://openalex.org/W2922392056","https://openalex.org/W204495562","https://openalex.org/W1566595779","https://openalex.org/W7051866791","https://openalex.org/W1184715927","https://openalex.org/W7168418299","https://openalex.org/W4249698868","https://openalex.org/W7060916274"],"abstract_inverted_index":{"A":[0],"novel":[1],"combination":[2],"of":[3,29,41],"emergent":[4],"algorithmic":[5],"methods,":[6],"powerful":[7],"computational":[8],"platforms":[9],"and":[10,18],"supporting":[11],"infrastructure":[12],"is":[13],"described.":[14],"These":[15],"complementary":[16],"tools":[17],"technologies":[19],"are":[20,47],"used":[21],"to":[22,37],"launch":[23],"systematic":[24],"attacks":[25],"on":[26],"combinatorial":[27],"problems":[28],"significance.":[30],"As":[31],"a":[32],"case":[33],"study,":[34],"optimal":[35],"solutions":[36],"very":[38],"large":[39],"instances":[40],"the":[42],"NP-hard":[43],"vertex":[44],"cover":[45],"problem":[46],"computed.":[48]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W247937228","counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2016-06-24T00:00:00"}
