{"id":"https://openalex.org/W2002516237","doi":"https://doi.org/10.1007/s004539910009","title":"Practical Performance of Efficient Minimum Cut Algorithms","display_name":"Practical Performance of Efficient Minimum Cut Algorithms","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2002516237","doi":"https://doi.org/10.1007/s004539910009","mag":"2002516237"},"language":"en","primary_location":{"id":"doi:10.1007/s004539910009","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s004539910009","pdf_url":"https://link.springer.com/content/pdf/10.1007/s004539910009.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007/s004539910009.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110594951","display_name":"Michael J\u00fcnger","orcid":null},"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":true,"raw_author_name":"M. J\u00fcnger","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, Pohligstra\u00df e 1, D-50969 K\u00f6ln, Germany. mjuenger@informatik.uni-koeln.de., , , , , , DE","Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, Pohligstra\u00df e 1, D-50969 K\u00f6ln, Germany. mjuenger@informatik.uni-koeln.de., , DE"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, Pohligstra\u00df e 1, D-50969 K\u00f6ln, Germany. mjuenger@informatik.uni-koeln.de., , , , , , DE","institution_ids":["https://openalex.org/I180923762"]},{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, Pohligstra\u00df e 1, D-50969 K\u00f6ln, Germany. mjuenger@informatik.uni-koeln.de., , DE","institution_ids":["https://openalex.org/I180923762"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103158920","display_name":"Giovanni Rinaldi","orcid":"https://orcid.org/0000-0003-0148-2470"},"institutions":[{"id":"https://openalex.org/I4210162062","display_name":"Istituto di Analisi dei Sistemi ed Informatica Antonio Ruberti","ror":"https://ror.org/054ye0e45","country_code":"IT","type":"facility","lineage":["https://openalex.org/I4210155236","https://openalex.org/I4210162062"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"G. Rinaldi","raw_affiliation_strings":["Istituto di Analisi dei Sistemi ed Informatica del CNR, Viale Manzoni 30, I-00185 Roma, Italy. rinaldi@iasi.rm.cnr.it., , , , , , IT","Istituto di Analisi dei Sistemi ed Informatica del CNR, Viale Manzoni 30, I-00185 Roma, Italy. rinaldi@iasi.rm.cnr.it., , IT"],"affiliations":[{"raw_affiliation_string":"Istituto di Analisi dei Sistemi ed Informatica del CNR, Viale Manzoni 30, I-00185 Roma, Italy. rinaldi@iasi.rm.cnr.it., , , , , , IT","institution_ids":["https://openalex.org/I4210162062"]},{"raw_affiliation_string":"Istituto di Analisi dei Sistemi ed Informatica del CNR, Viale Manzoni 30, I-00185 Roma, Italy. rinaldi@iasi.rm.cnr.it., , IT","institution_ids":["https://openalex.org/I4210162062"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028107064","display_name":"Stefan Thienel","orcid":null},"institutions":[{"id":"https://openalex.org/I71830129","display_name":"ThyssenKrupp (Germany)","ror":"https://ror.org/02vbxt202","country_code":"DE","type":"company","lineage":["https://openalex.org/I71830129"]},{"id":"https://openalex.org/I4210114304","display_name":"KraussMaffei (Germany)","ror":"https://ror.org/02718ec78","country_code":"DE","type":"company","lineage":["https://openalex.org/I4210113402","https://openalex.org/I4210114304"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"S. Thienel","raw_affiliation_strings":["Almenrauschstra\u00df e 2, D-82110 Germering, Germany. Stefan.Thienel@sdm.de., , , , , , DE","Almenrauschstra\u00df e 2, D-82110 Germering, Germany. Stefan.Thienel@sdm.de., , DE"],"affiliations":[{"raw_affiliation_string":"Almenrauschstra\u00df e 2, D-82110 Germering, Germany. Stefan.Thienel@sdm.de., , , , , , DE","institution_ids":["https://openalex.org/I71830129"]},{"raw_affiliation_string":"Almenrauschstra\u00df e 2, D-82110 Germering, Germany. Stefan.Thienel@sdm.de., , DE","institution_ids":["https://openalex.org/I4210114304"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5110594951"],"corresponding_institution_ids":["https://openalex.org/I180923762"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":8.4863,"has_fulltext":true,"cited_by_count":43,"citation_normalized_percentile":{"value":0.97063072,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"26","issue":"1","first_page":"172","last_page":"195"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T12176","display_name":"Optimization and Packing Problems","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T12288","display_name":"Optimization and Search Problems","score":0.9958000183105469,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.765708327293396},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7486269474029541},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6251245737075806},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5944117307662964},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5439093708992004},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.5002362728118896},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4743296504020691},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.44925177097320557},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31480294466018677},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.25006553530693054},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21927347779273987},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.19121599197387695}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.765708327293396},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7486269474029541},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6251245737075806},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5944117307662964},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5439093708992004},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.5002362728118896},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4743296504020691},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.44925177097320557},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31480294466018677},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.25006553530693054},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21927347779273987},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.19121599197387695}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s004539910009","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s004539910009","pdf_url":"https://link.springer.com/content/pdf/10.1007/s004539910009.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s004539910009","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s004539910009","pdf_url":"https://link.springer.com/content/pdf/10.1007/s004539910009.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2002516237.pdf","grobid_xml":"https://content.openalex.org/works/W2002516237.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W1503085769","https://openalex.org/W1537270317","https://openalex.org/W1541536235","https://openalex.org/W1594101105","https://openalex.org/W1685122025","https://openalex.org/W1967140769","https://openalex.org/W1986207529","https://openalex.org/W1992170089","https://openalex.org/W2005944337","https://openalex.org/W2009832821","https://openalex.org/W2032273637","https://openalex.org/W2032591091","https://openalex.org/W2035228443","https://openalex.org/W2042852020","https://openalex.org/W2045144252","https://openalex.org/W2090359754","https://openalex.org/W2095284441","https://openalex.org/W2103489475","https://openalex.org/W2114651839","https://openalex.org/W2115049345","https://openalex.org/W2121204510","https://openalex.org/W2152216760","https://openalex.org/W2163428398","https://openalex.org/W2168919539","https://openalex.org/W2401802705","https://openalex.org/W4251394903","https://openalex.org/W4285719527","https://openalex.org/W4389615578"],"related_works":["https://openalex.org/W2762130752","https://openalex.org/W2105006450","https://openalex.org/W1212691569","https://openalex.org/W2089185195","https://openalex.org/W2125126715","https://openalex.org/W4365506312","https://openalex.org/W3144226417","https://openalex.org/W2392203420","https://openalex.org/W2018269848","https://openalex.org/W2168539132"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":15},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}