{"id":"https://openalex.org/W1691798050","doi":"https://doi.org/10.1007/978-3-540-72397-4_5","title":"The \u201cNot-Too-Heavy Spanning Tree\u201d Constraint","display_name":"The \u201cNot-Too-Heavy Spanning Tree\u201d Constraint","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W1691798050","doi":"https://doi.org/10.1007/978-3-540-72397-4_5","mag":"1691798050"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-72397-4_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-72397-4_5","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5108500403","display_name":"Gr\u00e9goire Dooms","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gr\u00e9goire Dooms","raw_affiliation_strings":["Department of Computer Science, Brown University, Providence, RI,","Department of Computer Science, Brown University, Providence, RI, \u00a0"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brown University, Providence, RI,","institution_ids":["https://openalex.org/I27804330"]},{"raw_affiliation_string":"Department of Computer Science, Brown University, Providence, RI, \u00a0","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028865873","display_name":"Irit Katriel","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Irit Katriel","raw_affiliation_strings":["Department of Computer Science, Brown University, Providence, RI,","Department of Computer Science, Brown University, Providence, RI, \u00a0"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brown University, Providence, RI,","institution_ids":["https://openalex.org/I27804330"]},{"raw_affiliation_string":"Department of Computer Science, Brown University, Providence, RI, \u00a0","institution_ids":["https://openalex.org/I27804330"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I27804330"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.4201,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.79992038,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"59","last_page":"70"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9977999925613403,"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.9977999925613403,"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/T11106","display_name":"Data Management and Algorithms","score":0.9973000288009644,"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/T10317","display_name":"Advanced Database Systems and Queries","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"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.803051769733429},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.599788248538971},{"id":"https://openalex.org/keywords/scalar","display_name":"Scalar (mathematics)","score":0.5839099884033203},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5815811157226562},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5429418683052063},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.5166440606117249},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5062276721000671},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5031978487968445},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.4620489478111267},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.460160493850708},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45716536045074463},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.44339871406555176},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43869245052337646},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.426385760307312},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.42047086358070374},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4195302128791809},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3823583424091339},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.21523749828338623},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.09563586115837097}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.803051769733429},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.599788248538971},{"id":"https://openalex.org/C57691317","wikidata":"https://www.wikidata.org/wiki/Q1289248","display_name":"Scalar (mathematics)","level":2,"score":0.5839099884033203},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5815811157226562},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5429418683052063},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.5166440606117249},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5062276721000671},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5031978487968445},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.4620489478111267},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.460160493850708},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45716536045074463},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.44339871406555176},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43869245052337646},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.426385760307312},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.42047086358070374},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4195302128791809},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3823583424091339},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.21523749828338623},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.09563586115837097},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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":2,"locations":[{"id":"doi:10.1007/978-3-540-72397-4_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-72397-4_5","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:dial.uclouvain.be:boreal:67866","is_oa":false,"landing_page_url":"http://hdl.handle.net/2078.1/67866","pdf_url":null,"source":{"id":"https://openalex.org/S4306401902","display_name":"Digital Access to Libraries (Universit\u00e9 catholique de Louvain (UCL), l'Universit\u00e9 de Namur (UNamur) and the Universit\u00e9 Saint-Louis (USL-B))","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I95674353","host_organization_name":"UCLouvain","host_organization_lineage":["https://openalex.org/I95674353"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W134390639","https://openalex.org/W164627744","https://openalex.org/W1483207614","https://openalex.org/W1505329698","https://openalex.org/W1538603553","https://openalex.org/W1554127434","https://openalex.org/W1570763516","https://openalex.org/W1574082713","https://openalex.org/W1583065959","https://openalex.org/W1652823179","https://openalex.org/W1867111234","https://openalex.org/W1978099551","https://openalex.org/W1986022261","https://openalex.org/W1999760725","https://openalex.org/W2001769932","https://openalex.org/W2003149804","https://openalex.org/W2011039300","https://openalex.org/W2023658462","https://openalex.org/W2055505431","https://openalex.org/W2059690430","https://openalex.org/W2085716817","https://openalex.org/W2118382442","https://openalex.org/W2133612817","https://openalex.org/W2151028272","https://openalex.org/W2164279585","https://openalex.org/W2485414348","https://openalex.org/W2487140311","https://openalex.org/W2497660909","https://openalex.org/W2501112583","https://openalex.org/W2604163174","https://openalex.org/W2752885492","https://openalex.org/W2762051376","https://openalex.org/W3145128584"],"related_works":["https://openalex.org/W2943635264","https://openalex.org/W1997570556","https://openalex.org/W2005362242","https://openalex.org/W2518240130","https://openalex.org/W2408068853","https://openalex.org/W2779648845","https://openalex.org/W2071845176","https://openalex.org/W1754127855","https://openalex.org/W1576317141","https://openalex.org/W2911818503"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}