{"id":"https://openalex.org/W1978394966","doi":"https://doi.org/10.1145/2133803.2330084","title":"An SDP approach to multi-level crossing minimization","display_name":"An SDP approach to multi-level crossing minimization","publication_year":2012,"publication_date":"2012-07-01","ids":{"openalex":"https://openalex.org/W1978394966","doi":"https://doi.org/10.1145/2133803.2330084","mag":"1978394966"},"language":"en","primary_location":{"id":"doi:10.1145/2133803.2330084","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2133803.2330084","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","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/A5044475263","display_name":"Markus Chimani","orcid":"https://orcid.org/0000-0002-4681-5550"},"institutions":[{"id":"https://openalex.org/I76198965","display_name":"Friedrich Schiller University Jena","ror":"https://ror.org/05qpz1x62","country_code":"DE","type":"education","lineage":["https://openalex.org/I76198965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Markus Chimani","raw_affiliation_strings":["Friedrich-Schiller-University of Jena, Germany","Friedrich-Schiller University of Jena (Germany)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Friedrich-Schiller-University of Jena, Germany","institution_ids":["https://openalex.org/I76198965"]},{"raw_affiliation_string":"Friedrich-Schiller University of Jena (Germany)","institution_ids":["https://openalex.org/I76198965"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042888689","display_name":"Philipp Hungerl\u00e4nder","orcid":"https://orcid.org/0000-0002-9596-1298"},"institutions":[{"id":"https://openalex.org/I4210166741","display_name":"University of Klagenfurt","ror":"https://ror.org/05q9m0937","country_code":"AT","type":"education","lineage":["https://openalex.org/I4210166741"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Philipp Hungerl\u00e4nder","raw_affiliation_strings":["Alpen-Adria Universit\u00e4t Klagenfurt, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Alpen-Adria Universit\u00e4t Klagenfurt, Austria","institution_ids":["https://openalex.org/I4210166741"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016595075","display_name":"Michael J\u00fcnger","orcid":"https://orcid.org/0000-0002-7574-6646"},"institutions":[{"id":"https://openalex.org/I180923762","display_name":"University of Cologne","ror":"https://ror.org/00rcxh774","country_code":"DE","type":"education","lineage":["https://openalex.org/I180923762"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Michael J\u00fcnger","raw_affiliation_strings":["University of Cologne, Germany","University of Cologne, Germany,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Cologne, Germany","institution_ids":["https://openalex.org/I180923762"]},{"raw_affiliation_string":"University of Cologne, Germany,","institution_ids":["https://openalex.org/I180923762"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012801992","display_name":"Petra Mutzel","orcid":"https://orcid.org/0000-0001-7621-971X"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Petra Mutzel","raw_affiliation_strings":["Technische Universit\u00e4t Dortmund, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.9463,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.9118514,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"17","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9936000108718872,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9936000108718872,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9843999743461609,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9692999720573425,"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/heuristics","display_name":"Heuristics","score":0.7851594686508179},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5777789950370789},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.5656755566596985},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5062033534049988},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5036064982414246},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48936957120895386},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4845392107963562},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4318864941596985},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.42205584049224854},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4157332181930542},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4086083471775055},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34682905673980713},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3350365459918976},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.07799544930458069}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7851594686508179},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5777789950370789},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.5656755566596985},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5062033534049988},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5036064982414246},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48936957120895386},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4845392107963562},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4318864941596985},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.42205584049224854},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4157332181930542},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4086083471775055},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34682905673980713},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3350365459918976},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.07799544930458069}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2133803.2330084","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2133803.2330084","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","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":36,"referenced_works":["https://openalex.org/W39451711","https://openalex.org/W97187767","https://openalex.org/W202264110","https://openalex.org/W777473119","https://openalex.org/W1485323191","https://openalex.org/W1553702074","https://openalex.org/W1569122551","https://openalex.org/W1587885046","https://openalex.org/W1588279470","https://openalex.org/W1966697435","https://openalex.org/W1972151695","https://openalex.org/W1985123706","https://openalex.org/W2004308446","https://openalex.org/W2005080287","https://openalex.org/W2021008323","https://openalex.org/W2033498477","https://openalex.org/W2049143039","https://openalex.org/W2058594920","https://openalex.org/W2071353749","https://openalex.org/W2085647652","https://openalex.org/W2099281231","https://openalex.org/W2100810364","https://openalex.org/W2105318109","https://openalex.org/W2106264302","https://openalex.org/W2111977144","https://openalex.org/W2115181545","https://openalex.org/W2126536832","https://openalex.org/W2128202699","https://openalex.org/W2141768845","https://openalex.org/W2146535985","https://openalex.org/W2148016452","https://openalex.org/W2172262955","https://openalex.org/W2296319761","https://openalex.org/W2566335580","https://openalex.org/W4250589301","https://openalex.org/W6834605779"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W2983685817","https://openalex.org/W4285278887","https://openalex.org/W2995925505","https://openalex.org/W134783735","https://openalex.org/W2365237642","https://openalex.org/W3116484972","https://openalex.org/W2941986668","https://openalex.org/W4232431455"],"abstract_inverted_index":{"We":[0,16,177],"present":[1,139],"an":[2,36,167,264],"approach":[3,194,211,273],"based":[4],"on":[5,41,185,188],"semidefinite":[6],"programs":[7],"(SDP)":[8],"to":[9,28,195,229,262,279,291,296,308,331,346],"tackle":[10],"the":[11,23,39,48,53,69,76,89,106,120,130,145,157,209,224,232,242,246,268,277,284,321,332,336,347],"multi-level":[12,147],"crossing":[13],"minimization":[14],"problem.":[15,313],"are":[17,26,33,305],"given":[18],"a":[19,83,97,140,162,179,196,288,328],"layered":[20],"graph":[21,49,73],"(i.e.,":[22],"graph's":[24],"vertices":[25],"assigned":[27],"multiple":[29],"parallel":[30],"levels)":[31],"and":[32,93,128,187,191,335],"asked":[34],"for":[35,113,119,132,144,150,205,215,220,255,311,320],"ordering":[37],"of":[38,56,85,91,123,182],"nodes":[40],"each":[42],"level":[43],"such":[44,221],"that,":[45,149,254],"when":[46],"drawing":[47,74],"with":[50,267],"straight":[51],"lines,":[52],"resulting":[54],"number":[55],"crossings":[57],"is":[58,63,67,153,212,237,343],"minimized.":[59],"Solving":[60],"this":[61,136,272,312,315],"step":[62],"crucial":[64],"in":[65,87,171],"what":[66],"probably":[68],"most":[70],"widely":[71],"used":[72],"scheme,":[75],"Sugiyama":[77],"framework.":[78],"The":[79,201],"problem":[80],"has":[81,287],"received":[82],"lot":[84],"attention":[86],"both":[88,184],"fields":[90],"heuristics":[92,310],"exact":[94,108],"methods.":[95],"For":[96],"long":[98],"time,":[99,283],"integer":[100],"linear":[101],"programming":[102],"(ILP)":[103],"approaches":[104],"were":[105,126],"only":[107],"algorithms":[109],"applicable,":[110],"at":[111],"least":[112],"small":[114],"graphs.":[115],"Recently,":[116],"SDP":[117,142,202,225,247,285],"formulations":[118],"special":[121],"case":[122],"two":[124,151],"levels":[125],"proposed":[127],"dominated":[129],"ILP":[131,210,243,269],"dense":[133],"instances.":[134,217],"In":[135,234,314],"article,":[137,316],"we":[138,164,304,317],"new":[141],"formulation":[143],"general":[146],"version":[148],"levels,":[152],"even":[154,219],"stronger":[155],"than":[156,231,301],"aforementioned":[158],"specialized":[159],"SDP.":[160],"As":[161],"by-product,":[163],"also":[165,306],"obtain":[166],"SDP-based":[168],"heuristic,":[169],"which":[170],"practice":[172],"always":[173],"gives":[174],"(near-)optimal":[175],"solutions.":[176],"conduct":[178],"large":[180,329],"set":[181],"experiments,":[183],"randomized":[186],"real-world":[189,299],"instances,":[190],"compare":[192],"our":[193,251],"state-of-the-art":[197,337],"ILP-based":[198],"branch-and-cut":[199],"implementation.":[200],"clearly":[203],"dominates":[204],"denser":[206],"graphs,":[207,223,257],"while":[208],"usually":[213,260,344],"faster":[214],"sparse":[216,222,256],"However,":[218],"solves":[226],"more":[227],"instances":[228,300],"optimality":[230,280],"ILP.":[233],"fact,":[235],"there":[236],"no":[238],"single":[239],"instance":[240,278],"that":[241,245,325,341],"solved":[244],"did":[248],"not.":[249],"Overall,":[250],"experiments":[252],"reveal":[253],"one":[258],"should":[259],"try":[261],"find":[263],"optimal":[265],"solution":[266],"first.":[270],"If":[271],"does":[274],"not":[275],"solve":[276,297],"within":[281],"reasonable":[282],"still":[286],"good":[289],"chance":[290],"do":[292,318],"so.":[293],"Being":[294],"able":[295,307],"larger":[298],"reported":[302],"before,":[303],"evaluate":[309],"so":[319],"traditional":[322],"barycenter-heuristic":[323],"(showing":[324,340],"it":[326,342],"leaves":[327],"gap":[330],"true":[333],"optimum)":[334],"upward-planarization":[338],"method":[339],"close":[345],"optimum).":[348]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}