{"id":"https://openalex.org/W2155236335","doi":"https://doi.org/10.1007/3-540-46521-9_12","title":"The Online-TSP against Fair Adversaries","display_name":"The Online-TSP against Fair Adversaries","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2155236335","doi":"https://doi.org/10.1007/3-540-46521-9_12","mag":"2155236335"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-46521-9_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-46521-9_12","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/A5008271277","display_name":"Michiel Blom","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109701","display_name":"KPN (Netherlands)","ror":"https://ror.org/01kzrk477","country_code":"NL","type":"company","lineage":["https://openalex.org/I4210109701"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Michiel Blom","raw_affiliation_strings":["KPN-Research, P. O. Box 421, 2260AK, Leidschendam, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KPN-Research, P. O. Box 421, 2260AK, Leidschendam, The Netherlands","institution_ids":["https://openalex.org/I4210109701"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069280526","display_name":"Sven O. Krumke","orcid":"https://orcid.org/0000-0002-8726-9963"},"institutions":[{"id":"https://openalex.org/I195893171","display_name":"Zuse Institute Berlin","ror":"https://ror.org/02eva5865","country_code":"DE","type":"facility","lineage":["https://openalex.org/I195893171"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sven O. Krumke","raw_affiliation_strings":["Department Optimization, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, Takustr. 7, D-14195, Berlin-Dahlem, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department Optimization, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, Takustr. 7, D-14195, Berlin-Dahlem, Germany","institution_ids":["https://openalex.org/I195893171"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072876885","display_name":"Willem E. de Paepe","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Willem de Paepe","raw_affiliation_strings":["Faculty of Technology Management, Technische Universiteit Eindhoven, P. O. Box 513, 5600MB, Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Technology Management, Technische Universiteit Eindhoven, P. O. Box 513, 5600MB, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044184077","display_name":"Leen Stougie","orcid":"https://orcid.org/0000-0001-6938-8902"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Leen Stougie","raw_affiliation_strings":["Faculty of Mathematics and Computer Science, Technische Universiteit Eindhoven, P. O. Box 513, 5600MB, Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Computer Science, Technische Universiteit Eindhoven, P. O. Box 513, 5600MB, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5008271277"],"corresponding_institution_ids":["https://openalex.org/I4210109701"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.8059,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.86117936,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"137","last_page":"149"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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":1.0,"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/T11182","display_name":"Auction Theory and Applications","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9972000122070312,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8139326572418213},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7383450865745544},{"id":"https://openalex.org/keywords/adversary","display_name":"Adversary","score":0.7182610034942627},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6857789158821106},{"id":"https://openalex.org/keywords/adversary-model","display_name":"Adversary model","score":0.6195203065872192},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5803086161613464},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.559920608997345},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.41350722312927246},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2807086110115051},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25423455238342285},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.14695891737937927}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8139326572418213},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7383450865745544},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.7182610034942627},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6857789158821106},{"id":"https://openalex.org/C7606001","wikidata":"https://www.wikidata.org/wiki/Q4686702","display_name":"Adversary model","level":3,"score":0.6195203065872192},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5803086161613464},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.559920608997345},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.41350722312927246},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2807086110115051},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25423455238342285},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.14695891737937927},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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":4,"locations":[{"id":"doi:10.1007/3-540-46521-9_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-46521-9_12","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:pure.tue.nl:openaire_cris_publications/1bcc9a1f-6da2-4513-b961-af6d3dd8d365","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/1bcc9a1f-6da2-4513-b961-af6d3dd8d365","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Blom, M, Krumke, S O, Paepe, de, W E & Stougie, L 2000, The online-TSP against fair adversaries. in G C Bongiovanni, G Gambosi & R Petreschi (eds), Algorithms and Complexity (Proceedings 4th Italian Conference, CIAC 2000, Rome, Italy, March 1-3, 2000). Lecture Notes in Computer Science, vol. 1767, Springer, Berlin, pp. 137-149. https://doi.org/10.1007/3-540-46521-9_12","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.tue.nl:publications/a430bba7-d63b-4120-9d32-d41a90170ea7","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/a430bba7-d63b-4120-9d32-d41a90170ea7","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:tue:oai:pure.tue.nl:publications/1bcc9a1f-6da2-4513-b961-af6d3dd8d365","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/1bcc9a1f-6da2-4513-b961-af6d3dd8d365","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms and Complexity (Proceedings 4th Italian Conference, CIAC 2000, Rome, Italy, March 1-3, 2000), 137 - 149","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.550000011920929,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1512794094","https://openalex.org/W1531600130","https://openalex.org/W1539141971","https://openalex.org/W1552828154","https://openalex.org/W1561893369","https://openalex.org/W1562890522","https://openalex.org/W1570617517","https://openalex.org/W1585522101","https://openalex.org/W2056273707","https://openalex.org/W2807459278"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W1580966357","https://openalex.org/W2111697972","https://openalex.org/W2134822363","https://openalex.org/W2808555656","https://openalex.org/W934350761","https://openalex.org/W1565144941","https://openalex.org/W1525840184","https://openalex.org/W2109997134","https://openalex.org/W109506599"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2025-10-10T00:00:00"}