{"id":"https://openalex.org/W1511845892","doi":"https://doi.org/10.1007/978-3-642-14834-7_22","title":"Assessing the Performance of Bi-objective MST for Euclidean and Non-Euclidean Instances","display_name":"Assessing the Performance of Bi-objective MST for Euclidean and Non-Euclidean Instances","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1511845892","doi":"https://doi.org/10.1007/978-3-642-14834-7_22","mag":"1511845892"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-14834-7_22","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-14834-7_22","pdf_url":null,"source":{"id":"https://openalex.org/S2764900261","display_name":"Communications in computer and information science","issn_l":"1865-0929","issn":["1865-0929","1865-0937"],"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":"Communications in Computer and Information Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5023704176","display_name":"Soma Saha","orcid":null},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Soma Saha","raw_affiliation_strings":["Dept. of Computer Science & Engineering, Indian Institute of Technology Kharagpur, Kharagpur, WB, 721302, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science & Engineering, Indian Institute of Technology Kharagpur, Kharagpur, WB, 721302, India","institution_ids":["https://openalex.org/I145894827"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049269000","display_name":"M. Aslam","orcid":"https://orcid.org/0000-0002-7167-4374"},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Mohammad Aslam","raw_affiliation_strings":["Dept. of Computer Science & Engineering, Indian Institute of Technology Kharagpur, Kharagpur, WB, 721302, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science & Engineering, Indian Institute of Technology Kharagpur, Kharagpur, WB, 721302, India","institution_ids":["https://openalex.org/I145894827"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103387228","display_name":"Rajeev Kumar","orcid":null},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Rajeev Kumar","raw_affiliation_strings":["Dept. of Computer Science & Engineering, Indian Institute of Technology Kharagpur, Kharagpur, WB, 721302, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science & Engineering, Indian Institute of Technology Kharagpur, Kharagpur, WB, 721302, India","institution_ids":["https://openalex.org/I145894827"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1248,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.87207207,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"229","last_page":"240"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9980000257492065,"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.9980000257492065,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9914000034332275,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9865999817848206,"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/heuristics","display_name":"Heuristics","score":0.7975549697875977},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7256254553794861},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6957730054855347},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.657160758972168},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.6368124485015869},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5439453721046448},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5411376953125},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5028392672538757},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.49325793981552124},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.481471449136734},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4373050332069397},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.43200138211250305},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4141131043434143},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3708110451698303},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3584864139556885},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.11971169710159302},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08662375807762146},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.052770406007766724}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7975549697875977},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7256254553794861},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6957730054855347},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.657160758972168},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6368124485015869},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5439453721046448},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5411376953125},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5028392672538757},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.49325793981552124},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.481471449136734},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4373050332069397},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.43200138211250305},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4141131043434143},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3708110451698303},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3584864139556885},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11971169710159302},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08662375807762146},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.052770406007766724},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-14834-7_22","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-14834-7_22","pdf_url":null,"source":{"id":"https://openalex.org/S2764900261","display_name":"Communications in computer and information science","issn_l":"1865-0929","issn":["1865-0929","1865-0937"],"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":"Communications in Computer and Information Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1488001443","https://openalex.org/W1510935138","https://openalex.org/W1523604403","https://openalex.org/W1568706064","https://openalex.org/W1968026564","https://openalex.org/W1970231897","https://openalex.org/W1983511657","https://openalex.org/W2078614936","https://openalex.org/W2082629204","https://openalex.org/W2094076493","https://openalex.org/W2146766934","https://openalex.org/W2159991628","https://openalex.org/W2166775052","https://openalex.org/W2169162059","https://openalex.org/W2915410163","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W2099915933","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W2044443696","https://openalex.org/W2503538928","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
