{"id":"https://openalex.org/W2019149868","doi":"https://doi.org/10.1137/050631951","title":"Improved Approximation Algorithms for Weighted Hypergraph Embedding in a Cycle","display_name":"Improved Approximation Algorithms for Weighted Hypergraph Embedding in a Cycle","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2019149868","doi":"https://doi.org/10.1137/050631951","mag":"2019149868"},"language":"en","primary_location":{"id":"doi:10.1137/050631951","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050631951","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-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/A5050833349","display_name":"Hann\u2010Jang Ho","orcid":"https://orcid.org/0000-0001-6191-0882"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hann-Jang Ho","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5086479611","display_name":"SingLing Lee","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"SingLing Lee","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6718,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.71753451,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"18","issue":"4","first_page":"1490","last_page":"1500"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9941999912261963,"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"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9941999912261963,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9890999794006348,"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.9865000247955322,"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","display_name":"Hypergraph","score":0.9239423274993896},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7892513275146484},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.7564994096755981},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.6857649087905884},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.659354567527771},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5023963451385498},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49406197667121887},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.47895175218582153},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4346330761909485},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3471062481403351},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1245071291923523}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.9239423274993896},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7892513275146484},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.7564994096755981},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.6857649087905884},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.659354567527771},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5023963451385498},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49406197667121887},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.47895175218582153},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4346330761909485},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3471062481403351},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1245071291923523},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/050631951","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050631951","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1990361925","https://openalex.org/W1994116705","https://openalex.org/W2007178126","https://openalex.org/W2022446631","https://openalex.org/W2034886360","https://openalex.org/W2061040942","https://openalex.org/W2078971298","https://openalex.org/W2129452865","https://openalex.org/W2130150993","https://openalex.org/W2136294387","https://openalex.org/W2139729522","https://openalex.org/W2158689539"],"related_works":["https://openalex.org/W4376608589","https://openalex.org/W1532260067","https://openalex.org/W2543175834","https://openalex.org/W3089158720","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1903284337"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,17,24,32,75,91,95,100,129,136],"problem":[3,77,96],"of":[4,8,20,27,31,86,94,103],"embedding":[5,41,121],"weighted":[6,39,59],"hyperedges":[7],"a":[9,14,43,80,114],"hypergraph":[10,40],"as":[11],"paths":[12],"in":[13,42],"cycle":[15,33,44],"on":[16],"same":[18],"number":[19],"vertices,":[21],"such":[22],"that":[23],"maximum":[25],"congestion":[26,123],"any":[28,106],"physical":[29],"link":[30],"is":[34,46,55,124],"minimized.":[35],"The":[36],"problem,":[37],"called":[38],"(WHEC),":[45],"known":[47],"to":[48,78,118],"be":[49],"NP-complete":[50],"even":[51],"when":[52],"each":[53,58],"hyperedge":[54,60],"unweighted":[56],"or":[57],"contains":[61],"exactly":[62],"two":[63],"vertices.":[64],"In":[65],"this":[66],"paper,":[67],"we":[68,111],"propose":[69],"an":[70,83,120],"improved":[71],"rounding":[72],"algorithm":[73,117],"for":[74,135],"WHEC":[76,138],"provide":[79,119],"solution":[81],"with":[82],"approximation":[84],"bound":[85],"$1.5(opt+w_{max})$,":[87],"where":[88],"$opt$":[89],"represents":[90],"optimal":[92],"value":[93],"and":[97],"$w_{max}$":[98],"denotes":[99],"largest":[101],"weight":[102],"hyperedges.":[104],"For":[105],"fixed":[107],"$\\varepsilon":[108],">":[109],"0$,":[110],"also":[112],"present":[113],"polynomial":[115],"time":[116],"whose":[122],"at":[125],"most":[126],"$(1.5+\\varepsilon)$":[127],"times":[128],"optimum.":[130],"This":[131],"improves":[132],"previous":[133],"results":[134],"general":[137],"problem.":[139]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}