{"id":"https://openalex.org/W1999980591","doi":"https://doi.org/10.1142/s0129626405002167","title":"THE COMPLEXITY OF THE MAXIMAL REQUESTS SATISFACTION PROBLEM IN MULTIPOINT COMMUNICATION","display_name":"THE COMPLEXITY OF THE MAXIMAL REQUESTS SATISFACTION PROBLEM IN MULTIPOINT COMMUNICATION","publication_year":2005,"publication_date":"2005-03-01","ids":{"openalex":"https://openalex.org/W1999980591","doi":"https://doi.org/10.1142/s0129626405002167","mag":"1999980591"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626405002167","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626405002167","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"},"type":"article","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/A5019901146","display_name":"Dominique Barth","orcid":null},"institutions":[{"id":"https://openalex.org/I195731000","display_name":"Universit\u00e9 de Versailles Saint-Quentin-en-Yvelines","ror":"https://ror.org/03mkjjy25","country_code":"FR","type":"education","lineage":["https://openalex.org/I195731000","https://openalex.org/I277688954"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"DOMINIQUE BARTH","raw_affiliation_strings":["Laboratoire de Research en Informatique  PRiSM, Universit\u00e9 de Versailles St-Quentin en Yvelines,  45 Avenue des Etats-Unis, 78035 Versailles Cedex, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire de Research en Informatique  PRiSM, Universit\u00e9 de Versailles St-Quentin en Yvelines,  45 Avenue des Etats-Unis, 78035 Versailles Cedex, France","institution_ids":["https://openalex.org/I195731000"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052742477","display_name":"Pascal Berthom\u00e9","orcid":null},"institutions":[{"id":"https://openalex.org/I102197404","display_name":"Universit\u00e9 Paris-Sud","ror":"https://ror.org/028rypz17","country_code":"FR","type":"education","lineage":["https://openalex.org/I102197404"]},{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"PASCAL BERTHOME","raw_affiliation_strings":["Laboratoire de Research en  Informatique LRI, B\u00e2t 490, Universit\u00e9 Paris-Sud,  91405 Orsay Cedex, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire de Research en  Informatique LRI, B\u00e2t 490, Universit\u00e9 Paris-Sud,  91405 Orsay Cedex, France","institution_ids":["https://openalex.org/I102197404","https://openalex.org/I4210144804"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047117000","display_name":"Paraskevi Fragopoulou","orcid":"https://orcid.org/0000-0002-7134-9029"},"institutions":[{"id":"https://openalex.org/I28710699","display_name":"Hellenic Mediterranean University","ror":"https://ror.org/039ce0m20","country_code":"GR","type":"education","lineage":["https://openalex.org/I28710699"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"PARASKEVI FRAGOPOULOU","raw_affiliation_strings":["Department of Applied Informatics  and Multimedia, Technological Educational Institute of Crete,  P.O. Box 1939, GR-71004 Heraklion-Crete, Greece","Department of Applied Informatics and Multimedia, Technological Educational Institute of Crete, P.O. Box 1939, GR-71004 Heraklion-Crete, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Applied Informatics  and Multimedia, Technological Educational Institute of Crete,  P.O. Box 1939, GR-71004 Heraklion-Crete, Greece","institution_ids":["https://openalex.org/I28710699"]},{"raw_affiliation_string":"Department of Applied Informatics and Multimedia, Technological Educational Institute of Crete, P.O. Box 1939, GR-71004 Heraklion-Crete, Greece","institution_ids":["https://openalex.org/I28710699"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5019901146"],"corresponding_institution_ids":["https://openalex.org/I195731000"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14318066,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"15","issue":"01n02","first_page":"209","last_page":"222"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9994000196456909,"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/computer-science","display_name":"Computer science","score":0.7502105236053467},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.579484760761261},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5712446570396423},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5597100853919983},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.5364869832992554},{"id":"https://openalex.org/keywords/interconnection","display_name":"Interconnection","score":0.516286313533783},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.472870796918869},{"id":"https://openalex.org/keywords/telecommunications-network","display_name":"Telecommunications network","score":0.4529409408569336},{"id":"https://openalex.org/keywords/duration","display_name":"Duration (music)","score":0.4402029812335968},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43450042605400085},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4182097911834717},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4158231019973755},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3496314287185669},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22138407826423645},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20806357264518738},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.1132253110408783}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7502105236053467},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.579484760761261},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5712446570396423},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5597100853919983},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.5364869832992554},{"id":"https://openalex.org/C123745756","wikidata":"https://www.wikidata.org/wiki/Q1665949","display_name":"Interconnection","level":2,"score":0.516286313533783},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.472870796918869},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.4529409408569336},{"id":"https://openalex.org/C112758219","wikidata":"https://www.wikidata.org/wiki/Q16038819","display_name":"Duration (music)","level":2,"score":0.4402029812335968},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43450042605400085},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4182097911834717},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4158231019973755},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3496314287185669},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22138407826423645},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20806357264518738},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.1132253110408783},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129626405002167","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626405002167","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W109985799","https://openalex.org/W2011039300","https://openalex.org/W2017052164","https://openalex.org/W2021290577","https://openalex.org/W2043260929","https://openalex.org/W2044459128","https://openalex.org/W2050272710","https://openalex.org/W2069323107","https://openalex.org/W2074060643","https://openalex.org/W2077783414","https://openalex.org/W2082354586","https://openalex.org/W2089247135","https://openalex.org/W2120636801","https://openalex.org/W2506088122","https://openalex.org/W4248591100"],"related_works":["https://openalex.org/W2155019192","https://openalex.org/W2014709025","https://openalex.org/W2766970861","https://openalex.org/W3125341812","https://openalex.org/W1991674760","https://openalex.org/W4387560420","https://openalex.org/W961142965","https://openalex.org/W2113623403","https://openalex.org/W4377371889","https://openalex.org/W119245487"],"abstract_inverted_index":{"A":[0],"multipoint":[1],"request":[2,47],"is":[3,48,79,99],"a":[4,13,16,51,102],"group":[5],"of":[6,19,64,93],"collaborating":[7],"nodes":[8],"that":[9,66,76,90],"wish":[10],"to":[11,60],"establish":[12],"communication":[14,43],"for":[15,84],"certain":[17],"duration":[18],"time.":[20],"This":[21],"need":[22],"arises":[23],"in":[24],"parallel":[25],"applications":[26],"executed":[27],"on":[28],"processing":[29],"elements":[30],"connected":[31],"either":[32],"by":[33,50,101],"specialized":[34],"interconnection":[35],"networks":[36,41],"or":[37],"over":[38],"wide":[39],"area":[40],"(collective":[42],"operations).":[44],"Each":[45],"individual":[46],"satisfied":[49],"given":[52],"subtree":[53],"connecting":[54],"the":[55,62,91,96],"participating":[56],"nodes.":[57],"We":[58],"aim":[59],"maximize":[61],"number":[63,92],"requests":[65,94],"can":[67],"be":[68],"simultaneously":[69],"satisfied.":[70],"In":[71],"this":[72,77],"paper,":[73],"we":[74,82],"show":[75],"problem":[78],"NP-complete":[80],"and":[81],"propose":[83],"it":[85],"an":[86],"approximation":[87],"algorithm":[88],"provided":[89],"using":[95],"same":[97],"edge":[98],"bounded":[100],"constant.":[103]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}