{"id":"https://openalex.org/W821239940","doi":"https://doi.org/10.1007/978-3-662-43951-7_48","title":"Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems","display_name":"Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W821239940","doi":"https://doi.org/10.1007/978-3-662-43951-7_48","mag":"821239940"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-43951-7_48","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-43951-7_48","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":"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/A5076053703","display_name":"Afshin Nikzad","orcid":"https://orcid.org/0000-0002-8085-705X"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Afshin Nikzad","raw_affiliation_strings":["MS&E Department, Stanford University, USA","Stanford University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MS&E Department, Stanford University, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087844619","display_name":"R. Ravi","orcid":"https://orcid.org/0000-0001-7603-1207"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Ravi","raw_affiliation_strings":["Tepper School of Business, Carnegie Mellon University, USA","Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tepper School of Business, Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5076053703"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.13066051,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"568","last_page":"607"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9995999932289124,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/multicast","display_name":"Multicast","score":0.7953974604606628},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7058377265930176},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5544567704200745},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5046099424362183},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.48570069670677185},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.46559226512908936},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4645495116710663},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.42891305685043335},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.42089083790779114},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3788281977176666},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3663451075553894},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3567748963832855},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3400465250015259},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.330902636051178},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26862654089927673},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.17244696617126465}],"concepts":[{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.7953974604606628},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7058377265930176},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5544567704200745},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5046099424362183},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.48570069670677185},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.46559226512908936},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4645495116710663},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.42891305685043335},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.42089083790779114},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3788281977176666},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3663451075553894},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3567748963832855},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3400465250015259},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.330902636051178},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26862654089927673},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.17244696617126465},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-662-43951-7_48","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-43951-7_48","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:CiteSeerX.psu:10.1.1.721.4626","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.721.4626","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.contrib.andrew.cmu.edu/%7Eravi/icalp2014.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W232259119","https://openalex.org/W1480942223","https://openalex.org/W1578934802","https://openalex.org/W1918603512","https://openalex.org/W1921938804","https://openalex.org/W1975039515","https://openalex.org/W1988687643","https://openalex.org/W2004232248","https://openalex.org/W2008755444","https://openalex.org/W2008802014","https://openalex.org/W2024631575","https://openalex.org/W2034133866","https://openalex.org/W2045371181","https://openalex.org/W2058422149","https://openalex.org/W2059437065","https://openalex.org/W2065543108","https://openalex.org/W2068322213","https://openalex.org/W2083990694","https://openalex.org/W2124124285","https://openalex.org/W2125349172","https://openalex.org/W2139417620","https://openalex.org/W2405145980","https://openalex.org/W2493698126","https://openalex.org/W2952550120","https://openalex.org/W3011766368","https://openalex.org/W4250266522"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W2004321562","https://openalex.org/W328736688","https://openalex.org/W2995411114","https://openalex.org/W3184075718","https://openalex.org/W2404561224"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2026-05-04T08:30:34.212998","created_date":"2025-10-10T00:00:00"}