3 Search Results for "Wolf, Klaus-Hendrik"

Document
DOI: 10.4230/LIPIcs.GIScience.2021.II.3
Comparison of Simulated Fast and Green Routes for Cyclists and Pedestrians

Authors: Christina Ludwig, Sven Lautenbach, Eva-Marie Schömann, and Alexander Zipf

Published in: LIPIcs, Volume 208, 11th International Conference on Geographic Information Science (GIScience 2021) - Part II

Abstract
Routes with a high share of greenery are attractive for cyclist and pedestrians. We analyze how strongly such green routes differ from the respective fast routes using the openrouteservice. Greenness of streets was estimated based on OpenStreetMap data in combination with Sentinel-II imagery, 3d laser scan data and administrative information on trees on public ground. We assess the effect both at the level of the individual route and at the urban level for two German cities: Dresden and Heidelberg. For individual routes, we study how strongly green routes differ from the respective fast routes. In addition, we identify parts of the road network which represent important green corridors as well as unattractive parts which can or cannot be avoided at the cost of reasonable detours. In both cities, our results show the importance of urban green spaces for the provision of attractive green routes and provide new insights for urban planning by identifying unvegetated bottlenecks in the street network for which no green alternatives exist at this point.
Cite as

Christina Ludwig, Sven Lautenbach, Eva-Marie Schömann, and Alexander Zipf. Comparison of Simulated Fast and Green Routes for Cyclists and Pedestrians. In 11th International Conference on Geographic Information Science (GIScience 2021) - Part II. Leibniz International Proceedings in Informatics (LIPIcs), Volume 208, pp. 3:1-3:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)

Copy BibTex To Clipboard

@InProceedings{ludwig_et_al:LIPIcs.GIScience.2021.II.3,
  author =	{Ludwig, Christina and Lautenbach, Sven and Sch\"{o}mann, Eva-Marie and Zipf, Alexander},
  title =	{{Comparison of Simulated Fast and Green Routes for Cyclists and Pedestrians}},
  booktitle =	{11th International Conference on Geographic Information Science (GIScience 2021) - Part II},
  pages =	{3:1--3:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-208-2},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{208},
  editor =	{Janowicz, Krzysztof and Verstegen, Judith A.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2021.II.3},
  URN =		{urn:nbn:de:0030-drops-147622},
  doi =		{10.4230/LIPIcs.GIScience.2021.II.3},
  annote =	{Keywords: Routing, OpenStreetMap, route choice, urban vegetation, sustainable mobility}
}
Document
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2015.416
The Container Selection Problem

Authors: Viswanath Nagarajan, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai, and Joel L. Wolf

Published in: LIPIcs, Volume 40, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)

Abstract
We introduce and study a network resource management problem that is a special case of non-metric k-median, naturally arising in cross platform scheduling and cloud computing. In the continuous d-dimensional container selection problem, we are given a set C of input points in d-dimensional Euclidean space, for some d >= 2, and a budget k. An input point p can be assigned to a "container point" c only if c dominates p in every dimension. The assignment cost is then equal to the L1-norm of the container point. The goal is to find k container points in the d-dimensional space, such that the total assignment cost for all input points is minimized. The discrete variant of the problem has one key distinction, namely, the container points must be chosen from a given set F of points. For the continuous version, we obtain a polynomial time approximation scheme for any fixed dimension d>= 2. On the negative side, we show that the problem is NP-hard for any d>=3. We further show that the discrete version is significantly harder, as it is NP-hard to approximate without violating the budget k in any dimension d>=3. Thus, we focus on obtaining bi-approximation algorithms. For d=2, the bi-approximation guarantee is (1+epsilon,3), i.e., for any epsilon>0, our scheme outputs a solution of size 3k and cost at most (1+epsilon) times the optimum. For fixed d>2, we present a (1+epsilon,O((1/epsilon)log k)) bi-approximation algorithm.
Cite as

Viswanath Nagarajan, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai, and Joel L. Wolf. The Container Selection Problem. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 40, pp. 416-434, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)

Copy BibTex To Clipboard

@InProceedings{nagarajan_et_al:LIPIcs.APPROX-RANDOM.2015.416,
  author =	{Nagarajan, Viswanath and Sarpatwar, Kanthi K. and Schieber, Baruch and Shachnai, Hadas and Wolf, Joel L.},
  title =	{{The Container Selection Problem}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)},
  pages =	{416--434},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-89-7},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{40},
  editor =	{Garg, Naveen and Jansen, Klaus and Rao, Anup and Rolim, Jos\'{e} D. P.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2015.416},
  URN =		{urn:nbn:de:0030-drops-53153},
  doi =		{10.4230/LIPIcs.APPROX-RANDOM.2015.416},
  annote =	{Keywords: non-metric k-median, geometric hitting set, approximation algorithms, cloud computing, cross platform scheduling.}
}
Document
DOI: 10.4230/DagSemProc.07462.26
The impact of sensor-enhanced regional health information systems

Authors: Klaus-Hendrik Wolf, Michael Marschollek, Jürgen Howe, and Reinhold Haux

Published in: Dagstuhl Seminar Proceedings, Volume 7462, Assisted Living Systems - Models, Architectures and Engineering Approaches (2008)

Abstract
The expected economic impact of new health enabling technologies is often used as motivation for their development. Another motivation is the predicted positive impact on health care in general. The objective of this paper is to give a simple example for an economic calculation based on statistical data. A positive effect on health care in general can only be gained if the new technologies are sustainably integrated in health care processes.
Cite as

Klaus-Hendrik Wolf, Michael Marschollek, Jürgen Howe, and Reinhold Haux. The impact of sensor-enhanced regional health information systems. In Assisted Living Systems - Models, Architectures and Engineering Approaches. Dagstuhl Seminar Proceedings, Volume 7462, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{wolf_et_al:DagSemProc.07462.26,
  author =	{Wolf, Klaus-Hendrik and Marschollek, Michael and Howe, J\"{u}rgen and Haux, Reinhold},
  title =	{{The impact of sensor-enhanced regional health information systems}},
  booktitle =	{Assisted Living Systems - Models, Architectures and Engineering Approaches},
  pages =	{1--3},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{7462},
  editor =	{Arthur I. Karshmer and J\"{u}rgen Nehmer and Hartmut Raffler and Gerhard Tr\"{o}ster},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07462.26},
  URN =		{urn:nbn:de:0030-drops-14535},
  doi =		{10.4230/DagSemProc.07462.26},
  annote =	{Keywords: Ageing society, health information systems, sensors}
}
  • Refine by Author
  • 1 Haux, Reinhold
  • 1 Howe, Jürgen
  • 1 Lautenbach, Sven
  • 1 Ludwig, Christina
  • 1 Marschollek, Michael
  • Show More...

  • Refine by Classification
  • 1 Applied computing → Cartography
  • 1 Computing methodologies → Simulation evaluation
  • 1 General and reference → Empirical studies

  • Refine by Keyword
  • 1 Ageing society
  • 1 OpenStreetMap
  • 1 Routing
  • 1 approximation algorithms
  • 1 cloud computing
  • Show More...

  • Refine by Type
  • 3 document

  • Refine by Publication Year
  • 1 2008
  • 1 2015
  • 1 2021

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact