{"id":"https://openalex.org/W2129452865","doi":"https://doi.org/10.1109/tpds.2005.62","title":"A 1.5 approximation algorithm for embedding hyperedges in a cycle","display_name":"A 1.5 approximation algorithm for embedding hyperedges in a cycle","publication_year":2005,"publication_date":"2005-05-03","ids":{"openalex":"https://openalex.org/W2129452865","doi":"https://doi.org/10.1109/tpds.2005.62","mag":"2129452865"},"language":"en","primary_location":{"id":"doi:10.1109/tpds.2005.62","doi":"https://doi.org/10.1109/tpds.2005.62","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2005.62","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-a","cwts-core","dongbi-a","jufo-2","norway-2","poland-140","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems","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/A5071747540","display_name":"Sing Ling 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":"Sing Ling Lee","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan","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/I162521676","display_name":"WuFeng University","ror":"https://ror.org/05d293n36","country_code":"TW","type":"education","lineage":["https://openalex.org/I162521676"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Hann-Jang Ho","raw_affiliation_strings":["Department of Information Management, Wu Feng Institute of Technology, Chiayi, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Management, Wu Feng Institute of Technology, Chiayi, Taiwan","institution_ids":["https://openalex.org/I162521676"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":0.6899,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.73696777,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":"16","issue":"6","first_page":"481","last_page":"488"},"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.9901999831199646,"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.9901999831199646,"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.0024999999441206455,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.002400000113993883,"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/hypergraph-embedding","display_name":"hypergraph embedding","score":0.8880000114440918},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.765999972820282},{"id":"https://openalex.org/keywords/integer-linear-programming","display_name":"integer linear programming","score":0.7379999756813049},{"id":"https://openalex.org/keywords/rounding-algorithms","display_name":"rounding algorithms","score":0.7680000066757202},{"id":"https://openalex.org/keywords/np-completeness","display_name":"NP-completeness","score":0.6639999747276306}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8271383047103882},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.7523389458656311},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.7171140313148499},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6595070958137512},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5711656808853149},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5692987442016602},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5343097448348999},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4846389889717102},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.453841894865036},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.44560280442237854},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4437357783317566},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44099393486976624},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43950581550598145},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3643977642059326},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.340938925743103},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tpds.2005.62","doi":"https://doi.org/10.1109/tpds.2005.62","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2005.62","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-a","cwts-core","dongbi-a","jufo-2","norway-2","poland-140","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.4943999946117401,"id":"https://metadata.un.org/sdg/9"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1538071919","https://openalex.org/W1783295460","https://openalex.org/W1990361925","https://openalex.org/W2007178126","https://openalex.org/W2013530391","https://openalex.org/W2022446631","https://openalex.org/W2032813508","https://openalex.org/W2034886360","https://openalex.org/W2058836520","https://openalex.org/W2061040942","https://openalex.org/W2074558211","https://openalex.org/W2078971298","https://openalex.org/W2096955471","https://openalex.org/W2139729522","https://openalex.org/W2158689539","https://openalex.org/W2336259629","https://openalex.org/W2912794399","https://openalex.org/W6758238719"],"related_works":["https://openalex.org/W7096350350","https://openalex.org/W2130150993","https://openalex.org/W1538071919","https://openalex.org/W3142756934","https://openalex.org/W2007178126","https://openalex.org/W2058787824","https://openalex.org/W1972142999","https://openalex.org/W2377365235","https://openalex.org/W159387477","https://openalex.org/W7100670931"],"abstract_inverted_index":{"The":[0,39],"problem":[1,40,64],"of":[2,16,77,95],"minimum":[3],"congestion":[4,29],"hypergraph":[5,18],"embedding":[6],"in":[7,34,43,47],"a":[8,17,23,72,85],"cycle":[9,36],"(MCHEC)":[10],"is":[11,37,41,81,102],"to":[12],"embed":[13],"the":[14,27,35,63,92,103,109],"hyperedges":[15,52],"as":[19,65],"adjacent":[20],"paths":[21],"around":[22],"cycle,":[24],"such":[25],"that":[26],"maximum":[28,96],"over":[30],"any":[31],"physical":[32],"link":[33],"minimized.":[38],"NP-complete":[42],"general,":[44],"but":[45],"solvable":[46],"polynomial":[48],"time":[49],"when":[50],"all":[51],"contain":[53],"exactly":[54],"two":[55],"vertices.":[56],"In":[57],"this":[58,101],"paper,":[59],"we":[60],"first":[61],"formulate":[62],"an":[66],"integer":[67],"linear":[68],"program":[69],"(ILP).":[70],"Then,":[71],"solution":[73],"with":[74],"approximation":[75,105],"bound":[76,106],"1.5(opt":[78],"+":[79],"1)":[80],"presented":[82],"by":[83],"using":[84],"clockwise":[86],"(2/3)-rounding":[87],"algorithm,":[88],"where":[89],"opt":[90],"denotes":[91],"optimal":[93],"value":[94],"congestion.":[97],"To":[98],"our":[99],"knowledge,":[100],"best":[104],"known":[107],"for":[108],"MCHEC":[110],"problem.":[111]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}