{"id":"https://openalex.org/W1994116705","doi":"https://doi.org/10.1016/s0020-0190(03)00297-7","title":"On minimizing the maximum congestion for Weighted Hypergraph Embedding in a Cycle","display_name":"On minimizing the maximum congestion for Weighted Hypergraph Embedding in a Cycle","publication_year":2003,"publication_date":"2003-06-09","ids":{"openalex":"https://openalex.org/W1994116705","doi":"https://doi.org/10.1016/s0020-0190(03)00297-7","mag":"1994116705"},"language":"en","primary_location":{"id":"doi:10.1016/s0020-0190(03)00297-7","doi":"https://doi.org/10.1016/s0020-0190(03)00297-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(03)00297-7","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","ccf-c","cwts-core","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-3"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"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/A5086479611","display_name":"SingLing Lee","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I148099254","display_name":"National Chung Cheng University","ror":"https://ror.org/0028v3876","country_code":"TW","type":"education","lineage":["https://openalex.org/I148099254"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"SingLing Lee","raw_affiliation_strings":["Dept. of Comput. Sci. & Information Eng., Nat. Chung Cheng Univ., Chiayi, Taiwan#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Comput. Sci. & Information Eng., Nat. Chung Cheng Univ., Chiayi, Taiwan#TAB#","institution_ids":["https://openalex.org/I148099254"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050833349","display_name":"Hann\u2010Jang Ho","orcid":"https://orcid.org/0000-0001-6191-0882","observed_orcids":["https://orcid.org/0000-0001-6191-0882"]},"institutions":[{"id":"https://openalex.org/I148099254","display_name":"National Chung Cheng University","ror":"https://ror.org/0028v3876","country_code":"TW","type":"education","lineage":["https://openalex.org/I148099254"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Hann-Jang Ho","raw_affiliation_strings":["Dept. of Comput. Sci. & Information Eng., Nat. Chung Cheng Univ., Chiayi, Taiwan#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Comput. Sci. & Information Eng., Nat. Chung Cheng Univ., Chiayi, Taiwan#TAB#","institution_ids":["https://openalex.org/I148099254"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I148099254"],"apc_list":{"value":2590,"currency":"USD","value_usd":2590},"apc_paid":null,"fwci":1.2111,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.76983323,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":"87","issue":"5","first_page":"271","last_page":"275"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9911999702453613,"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.9911999702453613,"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.005900000222027302,"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.0017000000225380063,"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/cycle-embedding","display_name":"cycle embedding","score":0.8579999804496765},{"id":"https://openalex.org/keywords/np-completeness","display_name":"NP-completeness","score":0.968999981880188},{"id":"https://openalex.org/keywords/integer-linear-programming-model","display_name":"integer linear programming formulation","score":0.9089999794960022},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"linear programming relaxation","score":0.8870000243186951},{"id":"https://openalex.org/keywords/rounding-heuristics","display_name":"rounding heuristics","score":0.9380000233650208},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.8690000176429749},{"id":"https://openalex.org/keywords/network-embedding","display_name":"graph embedding","score":0.45399999618530273}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.7721220254898071},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.6575952768325806},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5024361610412598},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44977423548698425},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41035032272338867},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3231510519981384},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1707954704761505}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0020-0190(03)00297-7","doi":"https://doi.org/10.1016/s0020-0190(03)00297-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(03)00297-7","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","ccf-c","cwts-core","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-3"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.504.1580","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.504.1580","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://par.cse.nsysu.edu.tw/~algo2002/session_paper/A0233.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W158665384","https://openalex.org/W1538071919","https://openalex.org/W1783295460","https://openalex.org/W2007178126","https://openalex.org/W2032813508","https://openalex.org/W2034886360","https://openalex.org/W2074558211","https://openalex.org/W2078971298","https://openalex.org/W2081192873","https://openalex.org/W2096955471","https://openalex.org/W2139729522","https://openalex.org/W2912794399","https://openalex.org/W6758238719"],"related_works":["https://openalex.org/W7098507279","https://openalex.org/W2147813579","https://openalex.org/W2019149868","https://openalex.org/W2364297802","https://openalex.org/W2120784479","https://openalex.org/W7099248730","https://openalex.org/W2105263704","https://openalex.org/W2172043826","https://openalex.org/W1561895609","https://openalex.org/W2129452865"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}