All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Polynomial time approximation schemes for clustering in low highway dimension graphs

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F20%3A10420370" target="_blank" >RIV/00216208:11320/20:10420370 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.4230/LIPIcs.ESA.2020.46" target="_blank" >https://doi.org/10.4230/LIPIcs.ESA.2020.46</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.4230/LIPIcs.ESA.2020.46" target="_blank" >10.4230/LIPIcs.ESA.2020.46</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Polynomial time approximation schemes for clustering in low highway dimension graphs

  • Original language description

    We study clustering problems such as k-Median, k-Means, and Facility Location in graphs of low highway dimension, which is a graph parameter modeling transportation networks.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GX19-27871X" target="_blank" >GX19-27871X: Efficient approximation algorithms and circuit complexity</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2020

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    28th Annual European Symposium on Algorithms (ESA 2020)

  • ISBN

    978-3-95977-162-7

  • ISSN

    1868-8969

  • e-ISSN

  • Number of pages

    22

  • Pages from-to

    1-22

  • Publisher name

    Schloss Dagstuhl--Leibniz-Zentrum f{&quot;u}r Informatik

  • Place of publication

    Dagstuhl

  • Event location

    Pisa, Italy

  • Event date

    Sep 7, 2020

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article