Improved Approximation Algorithms for Patrol-Scheduling with Min-Max Latency Using Multiclass Minimum Spanning Forests Article Swipe
Li-Hsuan Chen
,
Ling-Ju Hung
,
Ralf Klasing
·
YOU?
·
· 2024
· Open Access
·
· DOI: https://doi.org/10.1007/978-981-97-7801-0_9
YOU?
·
· 2024
· Open Access
·
· DOI: https://doi.org/10.1007/978-981-97-7801-0_9
Related Topics
Concepts
Metadata
- Type
- book-chapter
- Language
- en
- Landing Page
- https://doi.org/10.1007/978-981-97-7801-0_9
- OA Status
- green
- Cited By
- 1
- References
- 24
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4402625259
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4402625259Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1007/978-981-97-7801-0_9Digital Object Identifier
- Title
-
Improved Approximation Algorithms for Patrol-Scheduling with Min-Max Latency Using Multiclass Minimum Spanning ForestsWork title
- Type
-
book-chapterOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2024Year of publication
- Publication date
-
2024-01-01Full publication date if available
- Authors
-
Li-Hsuan Chen, Ling-Ju Hung, Ralf KlasingList of authors in order
- Landing page
-
https://doi.org/10.1007/978-981-97-7801-0_9Publisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://hal.science/hal-04728521Direct OA link when available
- Concepts
-
Computer science, Latency (audio), Scheduling (production processes), Minimum spanning tree, Algorithm, Parallel computing, Mathematical optimization, Mathematics, TelecommunicationsTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
1Total citation count in OpenAlex
- Citations by year (recent)
-
2025: 1Per-year citation counts (last 5 years)
- References (count)
-
24Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4402625259 |
|---|---|
| doi | https://doi.org/10.1007/978-981-97-7801-0_9 |
| ids.doi | https://doi.org/10.1007/978-981-97-7801-0_9 |
| ids.openalex | https://openalex.org/W4402625259 |
| fwci | 1.9002809 |
| type | book-chapter |
| title | Improved Approximation Algorithms for Patrol-Scheduling with Min-Max Latency Using Multiclass Minimum Spanning Forests |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | 110 |
| biblio.first_page | 99 |
| topics[0].id | https://openalex.org/T10567 |
| topics[0].field.id | https://openalex.org/fields/22 |
| topics[0].field.display_name | Engineering |
| topics[0].score | 0.9994999766349792 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/2209 |
| topics[0].subfield.display_name | Industrial and Manufacturing Engineering |
| topics[0].display_name | Vehicle Routing Optimization Methods |
| topics[1].id | https://openalex.org/T11814 |
| topics[1].field.id | https://openalex.org/fields/22 |
| topics[1].field.display_name | Engineering |
| topics[1].score | 0.9977999925613403 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/2209 |
| topics[1].subfield.display_name | Industrial and Manufacturing Engineering |
| topics[1].display_name | Advanced Manufacturing and Logistics Optimization |
| topics[2].id | https://openalex.org/T10586 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9969000220298767 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1707 |
| topics[2].subfield.display_name | Computer Vision and Pattern Recognition |
| topics[2].display_name | Robotic Path Planning Algorithms |
| is_xpac | False |
| apc_list.value | 5000 |
| apc_list.currency | EUR |
| apc_list.value_usd | 5392 |
| apc_paid | |
| concepts[0].id | https://openalex.org/C41008148 |
| concepts[0].level | 0 |
| concepts[0].score | 0.7828484773635864 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[0].display_name | Computer science |
| concepts[1].id | https://openalex.org/C82876162 |
| concepts[1].level | 2 |
| concepts[1].score | 0.5537183284759521 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q17096504 |
| concepts[1].display_name | Latency (audio) |
| concepts[2].id | https://openalex.org/C206729178 |
| concepts[2].level | 2 |
| concepts[2].score | 0.5120461583137512 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q2271896 |
| concepts[2].display_name | Scheduling (production processes) |
| concepts[3].id | https://openalex.org/C13743678 |
| concepts[3].level | 2 |
| concepts[3].score | 0.4109649658203125 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q240464 |
| concepts[3].display_name | Minimum spanning tree |
| concepts[4].id | https://openalex.org/C11413529 |
| concepts[4].level | 1 |
| concepts[4].score | 0.39793500304222107 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[4].display_name | Algorithm |
| concepts[5].id | https://openalex.org/C173608175 |
| concepts[5].level | 1 |
| concepts[5].score | 0.3360452353954315 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q232661 |
| concepts[5].display_name | Parallel computing |
| concepts[6].id | https://openalex.org/C126255220 |
| concepts[6].level | 1 |
| concepts[6].score | 0.3079056739807129 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[6].display_name | Mathematical optimization |
| concepts[7].id | https://openalex.org/C33923547 |
| concepts[7].level | 0 |
| concepts[7].score | 0.11969530582427979 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[7].display_name | Mathematics |
| concepts[8].id | https://openalex.org/C76155785 |
| concepts[8].level | 1 |
| concepts[8].score | 0.10289481282234192 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q418 |
| concepts[8].display_name | Telecommunications |
| keywords[0].id | https://openalex.org/keywords/computer-science |
| keywords[0].score | 0.7828484773635864 |
| keywords[0].display_name | Computer science |
| keywords[1].id | https://openalex.org/keywords/latency |
| keywords[1].score | 0.5537183284759521 |
| keywords[1].display_name | Latency (audio) |
| keywords[2].id | https://openalex.org/keywords/scheduling |
| keywords[2].score | 0.5120461583137512 |
| keywords[2].display_name | Scheduling (production processes) |
| keywords[3].id | https://openalex.org/keywords/minimum-spanning-tree |
| keywords[3].score | 0.4109649658203125 |
| keywords[3].display_name | Minimum spanning tree |
| keywords[4].id | https://openalex.org/keywords/algorithm |
| keywords[4].score | 0.39793500304222107 |
| keywords[4].display_name | Algorithm |
| keywords[5].id | https://openalex.org/keywords/parallel-computing |
| keywords[5].score | 0.3360452353954315 |
| keywords[5].display_name | Parallel computing |
| keywords[6].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[6].score | 0.3079056739807129 |
| keywords[6].display_name | Mathematical optimization |
| keywords[7].id | https://openalex.org/keywords/mathematics |
| keywords[7].score | 0.11969530582427979 |
| keywords[7].display_name | Mathematics |
| keywords[8].id | https://openalex.org/keywords/telecommunications |
| keywords[8].score | 0.10289481282234192 |
| keywords[8].display_name | Telecommunications |
| language | en |
| locations[0].id | doi:10.1007/978-981-97-7801-0_9 |
| locations[0].is_oa | False |
| locations[0].source.id | https://openalex.org/S106296714 |
| locations[0].source.issn | 0302-9743, 1611-3349 |
| locations[0].source.type | book series |
| locations[0].source.is_oa | False |
| locations[0].source.issn_l | 0302-9743 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | Lecture notes in computer science |
| locations[0].source.host_organization | https://openalex.org/P4310319900 |
| locations[0].source.host_organization_name | Springer Science+Business Media |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310319900, https://openalex.org/P4310319965 |
| locations[0].source.host_organization_lineage_names | Springer Science+Business Media, Springer Nature |
| locations[0].license | |
| locations[0].pdf_url | |
| locations[0].version | publishedVersion |
| locations[0].raw_type | book-chapter |
| locations[0].license_id | |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Lecture Notes in Computer Science |
| locations[0].landing_page_url | https://doi.org/10.1007/978-981-97-7801-0_9 |
| locations[1].id | pmh:oai:HAL:hal-04728521v1 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306402512 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | False |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | HAL (Le Centre pour la Communication Scientifique Directe) |
| locations[1].source.host_organization | https://openalex.org/I1294671590 |
| locations[1].source.host_organization_name | Centre National de la Recherche Scientifique |
| locations[1].source.host_organization_lineage | https://openalex.org/I1294671590 |
| locations[1].license | other-oa |
| locations[1].pdf_url | |
| locations[1].version | submittedVersion |
| locations[1].raw_type | Conference papers |
| locations[1].license_id | https://openalex.org/licenses/other-oa |
| locations[1].is_accepted | False |
| locations[1].is_published | False |
| locations[1].raw_source_name | 18th International Conference on Algorithmic Aspects in Information and Management (AAIM 2024), Sep 2024, Dallas / Virtual, United States. pp.99-110, ⟨10.1007/978-981-97-7801-0_9⟩ |
| locations[1].landing_page_url | https://hal.science/hal-04728521 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5055424928 |
| authorships[0].author.orcid | https://orcid.org/0009-0007-6528-7064 |
| authorships[0].author.display_name | Li-Hsuan Chen |
| authorships[0].countries | TW |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I148099254 |
| authorships[0].affiliations[0].raw_affiliation_string | National Chung-Cheng University (Minhsiung, Chiayi 621301 - Taiwan) |
| authorships[0].institutions[0].id | https://openalex.org/I148099254 |
| authorships[0].institutions[0].ror | https://ror.org/0028v3876 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I148099254 |
| authorships[0].institutions[0].country_code | TW |
| authorships[0].institutions[0].display_name | National Chung Cheng University |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Li-Hsuan Chen |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | National Chung-Cheng University (Minhsiung, Chiayi 621301 - Taiwan) |
| authorships[1].author.id | https://openalex.org/A5007511094 |
| authorships[1].author.orcid | https://orcid.org/0000-0001-5659-5507 |
| authorships[1].author.display_name | Ling-Ju Hung |
| authorships[1].countries | TW |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I43566213 |
| authorships[1].affiliations[0].raw_affiliation_string | NTUB - National Taipei University of Business (No. 321, Section 1, Jinan Rd, Zhongzheng District, Taipei City, Taïwan 100 - Taiwan) |
| authorships[1].institutions[0].id | https://openalex.org/I43566213 |
| authorships[1].institutions[0].ror | https://ror.org/029hrv109 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I43566213 |
| authorships[1].institutions[0].country_code | TW |
| authorships[1].institutions[0].display_name | National Taipei University of Business |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Ling-Ju Hung |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | NTUB - National Taipei University of Business (No. 321, Section 1, Jinan Rd, Zhongzheng District, Taipei City, Taïwan 100 - Taiwan) |
| authorships[2].author.id | https://openalex.org/A5112786437 |
| authorships[2].author.orcid | |
| authorships[2].author.display_name | Ralf Klasing |
| authorships[2].countries | FR |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I4210142254 |
| authorships[2].affiliations[0].raw_affiliation_string | LaBRI - Laboratoire Bordelais de Recherche en Informatique (Domaine Universitaire 351, cours de la Libération 33405 Talence Cedex - France) |
| authorships[2].institutions[0].id | https://openalex.org/I4210142254 |
| authorships[2].institutions[0].ror | https://ror.org/03adqg323 |
| authorships[2].institutions[0].type | facility |
| authorships[2].institutions[0].lineage | https://openalex.org/I1294671590, https://openalex.org/I1294671590, https://openalex.org/I15057530, https://openalex.org/I4210142254, https://openalex.org/I4210159245, https://openalex.org/I4210160189 |
| authorships[2].institutions[0].country_code | FR |
| authorships[2].institutions[0].display_name | Laboratoire Bordelais de Recherche en Informatique |
| authorships[2].author_position | last |
| authorships[2].raw_author_name | Ralf Klasing |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | LaBRI - Laboratoire Bordelais de Recherche en Informatique (Domaine Universitaire 351, cours de la Libération 33405 Talence Cedex - France) |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://hal.science/hal-04728521 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Improved Approximation Algorithms for Patrol-Scheduling with Min-Max Latency Using Multiclass Minimum Spanning Forests |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10567 |
| primary_topic.field.id | https://openalex.org/fields/22 |
| primary_topic.field.display_name | Engineering |
| primary_topic.score | 0.9994999766349792 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/2209 |
| primary_topic.subfield.display_name | Industrial and Manufacturing Engineering |
| primary_topic.display_name | Vehicle Routing Optimization Methods |
| related_works | https://openalex.org/W2418231958, https://openalex.org/W4220955759, https://openalex.org/W2307385607, https://openalex.org/W1561849181, https://openalex.org/W2390742649, https://openalex.org/W4313245519, https://openalex.org/W2049261842, https://openalex.org/W3016811403, https://openalex.org/W2099915933, https://openalex.org/W2350028416 |
| cited_by_count | 1 |
| counts_by_year[0].year | 2025 |
| counts_by_year[0].cited_by_count | 1 |
| locations_count | 2 |
| best_oa_location.id | pmh:oai:HAL:hal-04728521v1 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306402512 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | False |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | HAL (Le Centre pour la Communication Scientifique Directe) |
| best_oa_location.source.host_organization | https://openalex.org/I1294671590 |
| best_oa_location.source.host_organization_name | Centre National de la Recherche Scientifique |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I1294671590 |
| best_oa_location.license | other-oa |
| best_oa_location.pdf_url | |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | Conference papers |
| best_oa_location.license_id | https://openalex.org/licenses/other-oa |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | 18th International Conference on Algorithmic Aspects in Information and Management (AAIM 2024), Sep 2024, Dallas / Virtual, United States. pp.99-110, ⟨10.1007/978-981-97-7801-0_9⟩ |
| best_oa_location.landing_page_url | https://hal.science/hal-04728521 |
| primary_location.id | doi:10.1007/978-981-97-7801-0_9 |
| primary_location.is_oa | False |
| primary_location.source.id | https://openalex.org/S106296714 |
| primary_location.source.issn | 0302-9743, 1611-3349 |
| primary_location.source.type | book series |
| primary_location.source.is_oa | False |
| primary_location.source.issn_l | 0302-9743 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | Lecture notes in computer science |
| primary_location.source.host_organization | https://openalex.org/P4310319900 |
| primary_location.source.host_organization_name | Springer Science+Business Media |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310319900, https://openalex.org/P4310319965 |
| primary_location.source.host_organization_lineage_names | Springer Science+Business Media, Springer Nature |
| primary_location.license | |
| primary_location.pdf_url | |
| primary_location.version | publishedVersion |
| primary_location.raw_type | book-chapter |
| primary_location.license_id | |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Lecture Notes in Computer Science |
| primary_location.landing_page_url | https://doi.org/10.1007/978-981-97-7801-0_9 |
| publication_date | 2024-01-01 |
| publication_year | 2024 |
| referenced_works | https://openalex.org/W3170635652, https://openalex.org/W1995813020, https://openalex.org/W2071701840, https://openalex.org/W3023016019, https://openalex.org/W4310533732, https://openalex.org/W1544032329, https://openalex.org/W2125009529, https://openalex.org/W2117226423, https://openalex.org/W2143987816, https://openalex.org/W2093284501, https://openalex.org/W4308622943, https://openalex.org/W2018607199, https://openalex.org/W2078882488, https://openalex.org/W3167350281, https://openalex.org/W2962875727, https://openalex.org/W2145866065, https://openalex.org/W1980798330, https://openalex.org/W1987474585, https://openalex.org/W2132531944, https://openalex.org/W2017927472, https://openalex.org/W2039298646, https://openalex.org/W2124294571, https://openalex.org/W2160179157, https://openalex.org/W1976697723 |
| referenced_works_count | 24 |
| abstract_inverted_index | |
| cited_by_percentile_year.max | 95 |
| cited_by_percentile_year.min | 91 |
| countries_distinct_count | 2 |
| institutions_distinct_count | 3 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/15 |
| sustainable_development_goals[0].score | 0.41999998688697815 |
| sustainable_development_goals[0].display_name | Life in Land |
| citation_normalized_percentile.value | 0.83006727 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | True |