{"id":"https://openalex.org/W1798156434","doi":"https://doi.org/10.1007/978-3-540-68880-8_21","title":"A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem","display_name":"A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem","publication_year":2008,"publication_date":"2008-07-31","ids":{"openalex":"https://openalex.org/W1798156434","doi":"https://doi.org/10.1007/978-3-540-68880-8_21","mag":"1798156434"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-68880-8_21","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-68880-8_21","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/A5004777401","display_name":"Zeyu Guo","orcid":"https://orcid.org/0000-0001-7893-4346"},"institutions":[{"id":"https://openalex.org/I24943067","display_name":"Fudan University","ror":"https://ror.org/013q1eq08","country_code":"CN","type":"education","lineage":["https://openalex.org/I24943067"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zeyu Guo","raw_affiliation_strings":["Department of Computer Science and Engineering, Fudan University, China","Department of Computer Science & Engineering, Fudan University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Fudan University, China","institution_ids":["https://openalex.org/I24943067"]},{"raw_affiliation_string":"Department of Computer Science & Engineering, Fudan University, China","institution_ids":["https://openalex.org/I24943067"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062035495","display_name":"He Sun","orcid":"https://orcid.org/0000-0002-5852-3125"},"institutions":[{"id":"https://openalex.org/I24943067","display_name":"Fudan University","ror":"https://ror.org/013q1eq08","country_code":"CN","type":"education","lineage":["https://openalex.org/I24943067"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"He Sun","raw_affiliation_strings":["Shanghai Key Laboratory of Intelligent Information Processing, Fudan University, China","Shanghai Key Laboratory of Intelligent Information Processing, Fudan University, China#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Key Laboratory of Intelligent Information Processing, Fudan University, China","institution_ids":["https://openalex.org/I24943067"]},{"raw_affiliation_string":"Shanghai Key Laboratory of Intelligent Information Processing, Fudan University, China#TAB#","institution_ids":["https://openalex.org/I24943067"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101595940","display_name":"Hong Zhu","orcid":"https://orcid.org/0009-0007-8333-889X"},"institutions":[{"id":"https://openalex.org/I4210139618","display_name":"Shanghai Key Laboratory of Trustworthy Computing","ror":"https://ror.org/030qbr085","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210139618"]},{"id":"https://openalex.org/I66867065","display_name":"East China Normal University","ror":"https://ror.org/02n96ep67","country_code":"CN","type":"education","lineage":["https://openalex.org/I66867065"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hong Zhu","raw_affiliation_strings":["Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, China","[Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, China]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, China","institution_ids":["https://openalex.org/I4210139618","https://openalex.org/I66867065"]},{"raw_affiliation_string":"[Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, China]","institution_ids":["https://openalex.org/I66867065"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.6888,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.89180538,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"212","last_page":"223"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9973000288009644,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9973000288009644,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9970999956130981,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9954000115394592,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6528682112693787},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.628233015537262},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.594799280166626},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5296725034713745},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5276901721954346},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4574739933013916},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42539310455322266},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.42119142413139343},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38240674138069153},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30544620752334595},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.06398656964302063}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6528682112693787},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.628233015537262},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.594799280166626},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5296725034713745},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5276901721954346},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4574739933013916},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42539310455322266},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.42119142413139343},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38240674138069153},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30544620752334595},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.06398656964302063},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/978-3-540-68880-8_21","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-68880-8_21","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.222.6194","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.222.6194","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-inf.mpg.de/%7Ehsun/AAIM08.pdf","raw_type":"text"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/91cf8ebe-1c73-4580-8a63-bef15ec8cd8b","is_oa":false,"landing_page_url":"https://hdl.handle.net/1983/91cf8ebe-1c73-4580-8a63-bef15ec8cd8b","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Guo , Z , Sun , H & Zhu , H 2008 , A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem . in Algorithmic Aspects in Information and Management, 4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008. Proceedings . pp. 212-223 . https://doi.org/10.1007/978-3-540-68880-8_21","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/91cf8ebe-1c73-4580-8a63-bef15ec8cd8b","is_oa":false,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/91cf8ebe-1c73-4580-8a63-bef15ec8cd8b","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Guo, Z, Sun, H & Zhu, H 2008, A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem. in Algorithmic Aspects in Information and Management, 4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008. Proceedings. pp. 212-223. https://doi.org/10.1007/978-3-540-68880-8_21","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.4000000059604645,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W174408930","https://openalex.org/W1521561776","https://openalex.org/W1527145816","https://openalex.org/W1591044920","https://openalex.org/W1714524615","https://openalex.org/W2009319645","https://openalex.org/W2035405563","https://openalex.org/W2069104637","https://openalex.org/W2134026356","https://openalex.org/W2161943311","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2129550502","https://openalex.org/W2009808060","https://openalex.org/W2093961518","https://openalex.org/W2372801012","https://openalex.org/W2962917430","https://openalex.org/W2009843927","https://openalex.org/W2028468530","https://openalex.org/W2361133696","https://openalex.org/W4299801389","https://openalex.org/W1995629993"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}