{"id":"https://openalex.org/W2147813579","doi":"https://doi.org/10.1109/cw.2002.1180862","title":"Algorithms and complexity for weighted hypergraph embedding in a cycle","display_name":"Algorithms and complexity for weighted hypergraph embedding in a cycle","publication_year":2003,"publication_date":"2003-06-26","ids":{"openalex":"https://openalex.org/W2147813579","doi":"https://doi.org/10.1109/cw.2002.1180862","mag":"2147813579"},"language":"en","primary_location":{"id":"doi:10.1109/cw.2002.1180862","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cw.2002.1180862","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"First International Symposium on Cyber Worlds, 2002. Proceedings.","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/A5086479611","display_name":"SingLing Lee","orcid":null},"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":true,"raw_author_name":"SingLing Lee","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan"],"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"},"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":["Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan","institution_ids":["https://openalex.org/I148099254"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086479611"],"corresponding_institution_ids":["https://openalex.org/I148099254"],"apc_list":null,"apc_paid":null,"fwci":2.1274,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.87993274,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"10","issue":null,"first_page":"70","last_page":"75"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9977999925613403,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9922999739646912,"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/hypergraph","display_name":"Hypergraph","score":0.7782700657844543},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.7088018655776978},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.7045928239822388},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6147701144218445},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.49312326312065125},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4716871380805969},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4647478461265564},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.46029672026634216},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44890350103378296},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.44695717096328735},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44290921092033386},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4309682846069336},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.42998793721199036},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4257954955101013},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4202861189842224},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33740755915641785},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.31958097219467163}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.7782700657844543},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.7088018655776978},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.7045928239822388},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6147701144218445},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.49312326312065125},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4716871380805969},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4647478461265564},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.46029672026634216},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44890350103378296},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.44695717096328735},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44290921092033386},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4309682846069336},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.42998793721199036},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4257954955101013},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4202861189842224},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33740755915641785},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.31958097219467163},{"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/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"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/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/cw.2002.1180862","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cw.2002.1180862","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"First International Symposium on Cyber Worlds, 2002. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W2007178126","https://openalex.org/W2034886360","https://openalex.org/W2058836520","https://openalex.org/W2074558211","https://openalex.org/W2078971298","https://openalex.org/W2096955471","https://openalex.org/W2136294387","https://openalex.org/W2139729522"],"related_works":["https://openalex.org/W3100114454","https://openalex.org/W2507810539","https://openalex.org/W2035016254","https://openalex.org/W1600160158","https://openalex.org/W2137277194","https://openalex.org/W4399522325","https://openalex.org/W2031277014","https://openalex.org/W4287593987","https://openalex.org/W2561769964","https://openalex.org/W4287552035"],"abstract_inverted_index":{"The":[0,69],"problem":[1,44,103],"of":[2,16,30,42,59],"weighted":[3,14,47,57],"hypergraph":[4,18],"embedding":[5,49,128],"in":[6,22,34,50,66,76],"a":[7,17,23,51,60,67,145,152],"cycle":[8,36,52],"(WHEC)":[9],"is":[10,37,45],"to":[11,139],"embed":[12],"the":[13,20,27,35,46,56,64,101,135,141,155,162],"hyperedges":[15],"as":[19,63,104,161],"paths":[21,65],"cycle,":[24],"such":[25],"that":[26,54,90,149],"maximum":[28],"congestion":[29,130],"any":[31],"physical":[32],"link":[33],"minimized.":[38],"A":[39],"simpler":[40],"version":[41],"this":[43,85],"graph":[48,62],"(WGEC)":[53],"embeds":[55],"edges":[58],"normal":[61],"cycle.":[68],"WHEC":[70,92,102],"and":[71,81,93,120],"WGEC":[72,94],"problems":[73,95],"have":[74],"applications":[75],"design":[77],"automation,":[78],"parallel":[79],"computing":[80],"computer":[82],"communication.":[83],"In":[84],"paper":[86],"we":[87,99,143],"first":[88],"show":[89],"both":[91],"are":[96],"NP-Complete.":[97],"Afterwards":[98],"formulate":[100],"an":[105,111,127],"integer":[106],"linear":[107],"programming":[108],"(ILP).":[109],"Therefore,":[110],"approximation":[112,147,159],"solution":[113,153],"can":[114],"be":[115],"obtained":[116],"by":[117],"using":[118],"LP-relaxation":[119],"rounding":[121],"heuristic.":[122],"Our":[123],"LP-approximation":[124],"algorithm":[125,148],"generates":[126],"with":[129,154],"at":[131],"most":[132],"two":[133],"times":[134],"optimal":[136],"solution.":[137],"Finally,":[138],"guarantee":[140],"efficiency,":[142],"develop":[144],"linear-time":[146],"also":[150],"provides":[151],"same":[156],"worst":[157],"case":[158],"bound":[160],"LP-approximation.":[163]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}