{"id":"https://openalex.org/W1552282324","doi":"https://doi.org/10.1137/s1052623498334013","title":"An Alternative Method to Crossing Minimization on Hierarchical Graphs","display_name":"An Alternative Method to Crossing Minimization on Hierarchical Graphs","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1552282324","doi":"https://doi.org/10.1137/s1052623498334013","mag":"1552282324"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623498334013","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623498334013","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":true,"oa_status":"green","oa_url":"http://hdl.handle.net/11858/00-001M-0000-0014-9E22-8","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012801992","display_name":"Petra Mutzel","orcid":"https://orcid.org/0000-0001-7621-971X"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Petra Mutzel","raw_affiliation_strings":["Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5012801992"],"corresponding_institution_ids":["https://openalex.org/I149899117"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08168682,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"11","issue":"4","first_page":"1065","last_page":"1080"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.8356000185012817,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.8356000185012817,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.7872999906539917,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.7843000292778015,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7009785771369934},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6850993633270264},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5742989182472229},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5416567325592041},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5283409357070923},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.5144267678260803},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4689447581768036},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46287277340888977},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41257569193840027},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2373557686805725}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7009785771369934},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6850993633270264},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5742989182472229},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5416567325592041},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5283409357070923},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.5144267678260803},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4689447581768036},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46287277340888977},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41257569193840027},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2373557686805725}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1137/s1052623498334013","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623498334013","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.40.8218","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.8218","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-sb.mpg.de/~mutzel/alcomreports/MPI-I-97-1-008.ps.gz","raw_type":"text"},{"id":"pmh:oai:edoc.mpg.de:517826","is_oa":false,"landing_page_url":"http://edoc.mpg.de/517826","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"North, Stephen: Proceedings of the 4th Symposium on Graph Drawing (GD-96), Springer, 318-333 (1996)","raw_type":"Conference-Paper"},{"id":"pmh:oai:edoc.mpg.de:518192","is_oa":false,"landing_page_url":"http://edoc.mpg.de/518192","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Optimization, v.11, 1065-1080 (2001)","raw_type":"Article"},{"id":"pmh:oai:pure.mpg.de:item_1330548","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-3163-E","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Optimization","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.mpg.de:item_1331670","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0014-AB3F-1","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pure.mpg.de:item_1824294","is_oa":true,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0014-9E22-8","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Research Report / Max-Planck-Institut f\u00fcr Informatik","raw_type":"info:eu-repo/semantics/report"},{"id":"mag:1552282324","is_oa":false,"landing_page_url":"https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_1331670","pdf_url":null,"source":{"id":"https://openalex.org/S4306533943","display_name":"Untitled Event","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Untitled Event","raw_type":null}],"best_oa_location":{"id":"pmh:oai:pure.mpg.de:item_1824294","is_oa":true,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0014-9E22-8","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Research Report / Max-Planck-Institut f\u00fcr Informatik","raw_type":"info:eu-repo/semantics/report"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1972151695","https://openalex.org/W2012329067","https://openalex.org/W2021813567","https://openalex.org/W2038195012","https://openalex.org/W2047088053","https://openalex.org/W2071123968","https://openalex.org/W2071353749","https://openalex.org/W2076022481","https://openalex.org/W2080431890","https://openalex.org/W2094450647","https://openalex.org/W2099281231","https://openalex.org/W2158598102","https://openalex.org/W4237922239","https://openalex.org/W4252153853"],"related_works":["https://openalex.org/W2043128660","https://openalex.org/W2086628398","https://openalex.org/W3045113019","https://openalex.org/W2786376884","https://openalex.org/W3107634673","https://openalex.org/W2990059126","https://openalex.org/W2593343445","https://openalex.org/W2101537986","https://openalex.org/W2788334612","https://openalex.org/W2404422255","https://openalex.org/W2059418200","https://openalex.org/W3106367272","https://openalex.org/W2277335884","https://openalex.org/W2506178252","https://openalex.org/W2964998526","https://openalex.org/W2751855500","https://openalex.org/W2227009375","https://openalex.org/W3123225013","https://openalex.org/W2020913344","https://openalex.org/W2173754773"],"abstract_inverted_index":{"A":[0],"common":[1],"method":[2,47,227],"for":[3,48,110,151,201,228,254],"drawing":[4],"directed":[5],"graphs":[6],"is,":[7],"as":[8,24],"a":[9,17,25,77,108,120,128,138,175,225],"first":[10],"step,":[11,27,51],"to":[12,28],"partition":[13],"the":[14,30,33,37,49,54,61,68,71,85,93,102,116,152,161,167,191,195,207,233,245,248,256],"vertices":[15,31],"into":[16,76],"set":[18,168],"of":[19,39,57,83,118,124,140,169,174,232,247,259],"k":[20],"levels":[21,34],"and":[22,159,189],"then,":[23],"second":[26,50],"permute":[29],"within":[32],"such":[35,59],"that":[36,60,183,190,242],"number":[38,56],"crossings":[40],"is":[41,64,134],"minimized.":[42],"We":[43,180,267],"suggest":[44,91],"an":[45,146],"alternative":[46],"namely,":[52],"removing":[53],"minimal":[55],"edges":[58,73],"resulting":[62],"graph":[63,178],"k-level":[65,78,86,94],"planar.":[66],"For":[67],"final":[69],"diagram":[70],"removed":[72],"are":[74,199],"reinserted":[75],"planar":[79,122,142,172],"drawing.":[80],"Hence,":[81],"instead":[82],"considering":[84],"crossing":[87],"minimization":[88],"problem,":[89],"we":[90,100,106,114,144,157,238],"solving":[92,229],"planarization":[95,154,235],"problem.":[96,155,236],"In":[97],"this":[98,184],"paper":[99],"address":[101,115],"case":[103],"k=2.":[104],"First,":[105],"give":[107,145],"motivation":[109],"our":[111],"approach.":[112],"Then,":[113],"problem":[117,133,253],"extracting":[119],"2-level":[121,130,141,153,171,177,234],"subgraph":[123],"maximum":[125],"weight":[126],"in":[127,194,206,215,224,264],"given":[129,176],"graph.":[131],"This":[132],"NP-hard.":[135],"Based":[136],"on":[137,269],"characterization":[139],"graphs,":[143],"integer":[147,196,208],"linear":[148,197,209],"programming":[149,210],"formulation":[150,211],"Moreover,":[156],"define":[158],"investigate":[160],"polytope":[162,185],"$2{\\cal":[163,202],"LPS}(G)$":[164],"associated":[165],"with":[166],"all":[170,255],"subgraphs":[173],"G.":[179],"will":[181],"see":[182],"has":[186],"full":[187],"dimension":[188],"inequalities":[192,205,241,260],"occurring":[193],"description":[198],"facet-defining":[200],"LPS}(G)$.":[203],"The":[204,251],"can":[212,220,261],"be":[213,221,262],"separated":[214],"polynomial":[216,265],"time;":[217],"hence":[218],"they":[219],"used":[222],"efficiently":[223],"branch-and-cut":[226],"practical":[230],"instances":[231],"Furthermore,":[237],"derive":[239],"new":[240,257],"substantially":[243],"improve":[244],"quality":[246],"obtained":[249],"solution.":[250],"separation":[252],"classes":[258],"solved":[263],"time.":[266],"report":[268],"extensive":[270],"computational":[271],"results.":[272]},"counts_by_year":[],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}