{"id":"https://openalex.org/W4402707089","doi":"https://doi.org/10.1007/s10878-024-01204-z","title":"Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs","display_name":"Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs","publication_year":2024,"publication_date":"2024-09-21","ids":{"openalex":"https://openalex.org/W4402707089","doi":"https://doi.org/10.1007/s10878-024-01204-z"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-024-01204-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-024-01204-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-024-01204-z.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10878-024-01204-z.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038493522","display_name":"Niels Gr\u00fcttemeier","orcid":"https://orcid.org/0000-0002-6789-2918"},"institutions":[{"id":"https://openalex.org/I4210111500","display_name":"Fraunhofer Institute of Optronics, System Technologies and Image Exploitation","ror":"https://ror.org/01zx97922","country_code":"DE","type":"facility","lineage":["https://openalex.org/I4210111500","https://openalex.org/I4923324"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Niels Gr\u00fcttemeier","raw_affiliation_strings":["Fraunhofer IOSB-INA, Lemgo, Germany"],"raw_orcid":"https://orcid.org/0000-0002-6789-2918","affiliations":[{"raw_affiliation_string":"Fraunhofer IOSB-INA, Lemgo, Germany","institution_ids":["https://openalex.org/I4210111500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015525274","display_name":"Philipp Heinrich Ke\u00dfler","orcid":null},"institutions":[{"id":"https://openalex.org/I161103922","display_name":"Philipps University of Marburg","ror":"https://ror.org/01rdrb571","country_code":"DE","type":"education","lineage":["https://openalex.org/I161103922"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Philipp Heinrich Ke\u00dfler","raw_affiliation_strings":["Fachbereich Mathematik und Informatik, Philipps-Universit\u00e4t Marburg, Marburg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fachbereich Mathematik und Informatik, Philipps-Universit\u00e4t Marburg, Marburg, Germany","institution_ids":["https://openalex.org/I161103922"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087168202","display_name":"Christian Komusiewicz","orcid":"https://orcid.org/0000-0003-0829-7032"},"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":"Christian Komusiewicz","raw_affiliation_strings":["Fakult\u00e4t f\u00fcr Mathematik und Informatik, Friedrich-Schiller-Universit\u00e4t Jena, Jena, Germany"],"raw_orcid":"https://orcid.org/0000-0003-0829-7032","affiliations":[{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Mathematik und Informatik, Friedrich-Schiller-Universit\u00e4t Jena, Jena, Germany","institution_ids":["https://openalex.org/I76198965"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027185367","display_name":"Frank Sommer","orcid":"https://orcid.org/0000-0003-4034-525X"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Frank Sommer","raw_affiliation_strings":["Institute of Logic and Computation, TU Wien, Vienna, Austria"],"raw_orcid":"https://orcid.org/0000-0003-4034-525X","affiliations":[{"raw_affiliation_string":"Institute of Logic and Computation, TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5038493522"],"corresponding_institution_ids":["https://openalex.org/I4210111500"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17076809,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"48","issue":"3","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9972000122070312,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9972000122070312,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9969000220298767,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.994700014591217,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.7433854341506958},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6815059185028076},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5357263684272766},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.47723105549812317},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45976585149765015},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45236936211586},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4445730149745941},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3249232769012451},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.29521405696868896}],"concepts":[{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.7433854341506958},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6815059185028076},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5357263684272766},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.47723105549812317},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45976585149765015},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45236936211586},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4445730149745941},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3249232769012451},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.29521405696868896}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10878-024-01204-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-024-01204-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-024-01204-z.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:48:y:2024:i:3:d:10.1007_s10878-024-01204-z","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-024-01204-z","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:publica.fraunhofer.de:publica/478239","is_oa":true,"landing_page_url":"https://publica.fraunhofer.de/handle/publica/478239","pdf_url":null,"source":{"id":"https://openalex.org/S4306400318","display_name":"Fraunhofer-Publica (Fraunhofer-Gesellschaft)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4923324","host_organization_name":"Fraunhofer-Gesellschaft","host_organization_lineage":["https://openalex.org/I4923324"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"journal article"}],"best_oa_location":{"id":"doi:10.1007/s10878-024-01204-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-024-01204-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-024-01204-z.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3072270648","display_name":null,"funder_award_id":"KO 3669/6","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G3184373142","display_name":null,"funder_award_id":"KO 3669/6-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G3966283350","display_name":null,"funder_award_id":"EAGR (KO 3669/6-1)","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320322839","display_name":"Technische Universit\u00e4t Wien","ror":"https://ror.org/04d836q62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4402707089.pdf","grobid_xml":"https://content.openalex.org/works/W4402707089.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W131619556","https://openalex.org/W324754135","https://openalex.org/W1980096229","https://openalex.org/W1988659376","https://openalex.org/W2010661649","https://openalex.org/W2016182558","https://openalex.org/W2051438793","https://openalex.org/W2055245094","https://openalex.org/W2061931042","https://openalex.org/W2089494972","https://openalex.org/W2100978151","https://openalex.org/W2294347342","https://openalex.org/W2425914729","https://openalex.org/W2442815085","https://openalex.org/W2477601120","https://openalex.org/W2615011235","https://openalex.org/W2883786747","https://openalex.org/W2953865418","https://openalex.org/W3003314745","https://openalex.org/W4296230289","https://openalex.org/W4385782261"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2084616826","https://openalex.org/W1983294952","https://openalex.org/W2009796757","https://openalex.org/W2568448495","https://openalex.org/W2008600006","https://openalex.org/W1972259521","https://openalex.org/W2941986668","https://openalex.org/W2089185195","https://openalex.org/W4255223395"],"abstract_inverted_index":{"Abstract":[0],"In":[1,73],"the":[2,47,51,92,121,127,136],"Vertex":[3,56],"Triangle":[4,57,123],"2-Club":[5,58,124],"problem,":[6],"we":[7,76],"are":[8],"given":[9],"an":[10,61],"undirected":[11],"graph":[12],"G":[13,22],"and":[14,29,65,95],"aim":[15],"to":[16,98,120],"find":[17,99],"a":[18,78,85,112],"maximum-vertex":[19],"subgraph":[20],"of":[21,87,135],"that":[23],"has":[24],"diameter":[25],"at":[26,37],"most":[27],"2":[28],"in":[30,36,46,67,111],"which":[31],"every":[32],"vertex":[33],"is":[34,96,130],"contained":[35],"least":[38],"$$\\ell":[39],"$$":[40],"<mml:math":[41],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[42],"<mml:mi>\u2113</mml:mi>":[43],"</mml:math>":[44],"triangles":[45],"subgraph.":[48,137],"So":[49],"far,":[50],"only":[52],"algorithm":[53,81,119],"for":[54],"solving":[55],"relies":[59],"on":[60,102,132],"ILP":[62],"formulation":[63],"(Almeida":[64],"Br\u00e1s":[66],"Comput":[68],"Oper":[69],"Res":[70],"111:258\u2013270,":[71],"2019).":[72],"this":[74],"work,":[75],"develop":[77],"combinatorial":[79],"branch-and-bound":[80],"that,":[82],"coupled":[83],"with":[84,106],"set":[86],"data":[88],"reduction":[89],"rules,":[90],"outperforms":[91],"existing":[93],"implementation":[94],"able":[97],"optimal":[100],"solutions":[101],"sparse":[103],"real-world":[104],"graphs":[105],"more":[107],"than":[108],"100,000":[109],"vertices":[110],"few":[113],"minutes.":[114],"We":[115],"also":[116],"extend":[117],"our":[118],"Edge":[122],"problem":[125],"where":[126],"triangle":[128],"constraint":[129],"imposed":[131],"all":[133],"edges":[134]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}