3 Search Results for "Severín, Daniel E."

Document
DOI: 10.4230/LIPIcs.ISAAC.2025.44
Approximation Schemes for k-Subset Sum Ratio and k-Way Number Partitioning Ratio

Authors: Sotiris Kanellopoulos, Giorgos Mitropoulos, Antonis Antonopoulos, Nikos Leonardos, Aris Pagourtzis, Christos Pergaminelis, Stavros Petsalakis, and Kanellos Tsitouras

Published in: LIPIcs, Volume 359, 36th International Symposium on Algorithms and Computation (ISAAC 2025)

Abstract
The Subset Sum Ratio problem (SSR) asks, given a multiset A of positive integers, to find two disjoint subsets of A such that the largest-to-smallest ratio of their sums is minimized. In this paper we study the k-version of SSR, namely k-Subset Sum Ratio (k-SSR), which asks to minimize the largest-to-smallest ratio of sums of k disjoint subsets of A. We develop an approximation scheme for k-SSR running in O(n^{2k}/ε^{k-1}) time, where n = |A| and ε is the error parameter. To the best of our knowledge, this is the first FPTAS for k-SSR for fixed k > 2. We also study the k-way Number Partitioning Ratio (k-PART) problem, which differs from k-SSR in that the k subsets must constitute a partition of A; this problem in fact corresponds to the objective of minimizing the largest-to-smallest sum ratio in the family of Multiway Number Partitioning problems. We present a more involved FPTAS for k-PART, also achieving O(n^{2k}/ε^{k-1}) time complexity. Notably, k-PART is also equivalent to the Minimum Envy-Ratio problem with identical valuation functions, which has been studied in the context of fair division of indivisible goods. Thus, for the case of identical valuations, our FPTAS represents a significant improvement over the O(n^{4k²+1}/ε^{2k²}) bound obtained by Nguyen and Rothe’s FPTAS [Trung Thanh Nguyen and Jörg Rothe, 2014] for Minimum Envy-Ratio with general additive valuations. Lastly, we propose a second FPTAS for k-SSR, which employs carefully designed calls to the first one; the new scheme has a time complexity of Õ(n/ε^{3k-1}), thus being much faster when n≫ 1/ ε.
Cite as

Sotiris Kanellopoulos, Giorgos Mitropoulos, Antonis Antonopoulos, Nikos Leonardos, Aris Pagourtzis, Christos Pergaminelis, Stavros Petsalakis, and Kanellos Tsitouras. Approximation Schemes for k-Subset Sum Ratio and k-Way Number Partitioning Ratio. In 36th International Symposium on Algorithms and Computation (ISAAC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 359, pp. 44:1-44:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{kanellopoulos_et_al:LIPIcs.ISAAC.2025.44,
  author =	{Kanellopoulos, Sotiris and Mitropoulos, Giorgos and Antonopoulos, Antonis and Leonardos, Nikos and Pagourtzis, Aris and Pergaminelis, Christos and Petsalakis, Stavros and Tsitouras, Kanellos},
  title =	{{Approximation Schemes for k-Subset Sum Ratio and k-Way Number Partitioning Ratio}},
  booktitle =	{36th International Symposium on Algorithms and Computation (ISAAC 2025)},
  pages =	{44:1--44:22},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-408-6},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{359},
  editor =	{Chen, Ho-Lin and Hon, Wing-Kai and Tsai, Meng-Tsung},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2025.44},
  URN =		{urn:nbn:de:0030-drops-249521},
  doi =		{10.4230/LIPIcs.ISAAC.2025.44},
  annote =	{Keywords: Fully polynomial-time approximation schemes, Subset Sum Ratio, Number Partitioning, Fair division, Envy minimization, Pseudo-polynomial time algorithms}
}
Document
DOI: 10.4230/OASIcs.SpaceCHI.2025.32
Virtual Reality Prototyping Environment for Concurrent Design, Training and Rover Operations

Authors: Pinar Dogru, Hanjo Schnellbächer, Tarek Can Battikh, and Kristina Remić

Published in: OASIcs, Volume 130, Advancing Human-Computer Interaction for Space Exploration (SpaceCHI 2025)

Abstract
As part of the CASIMAR (Collaborative Astronaut Supporting Interregional Moon Analog Rover) project, initiated by the BVSR e.V. (Bundesverband Studentischer Raumfahrt), the TUDSaT (TU Darmstadt Space Technology e.V.) team is developing a Virtual Reality (VR) prototype environment to support the interdisciplinary design process of lunar exploration technologies. Given the complexity of collaboration among eight organizations, this tool aims to streamline design integration and enhance mission planning. The primary objective is to create a comprehensive 3D model of the rover, complete with predefined procedures and activities, to simulate astronaut-robot interaction. By leveraging VR technology, astronauts can familiarize themselves with the rover and its EVA (Extravehicular Activity) tools before actual deployment, improving operational safety and efficiency. Beyond training applications, this virtual environment serves as a critical platform for designing, testing, and benchmarking rover functionalities and EVA procedures. Ultimately, our work contributes to optimizing human-robotic interaction, ensuring that lunar exploration missions are both effective and well-prepared before reaching the Moon.
Cite as

Pinar Dogru, Hanjo Schnellbächer, Tarek Can Battikh, and Kristina Remić. Virtual Reality Prototyping Environment for Concurrent Design, Training and Rover Operations. In Advancing Human-Computer Interaction for Space Exploration (SpaceCHI 2025). Open Access Series in Informatics (OASIcs), Volume 130, pp. 32:1-32:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{dogru_et_al:OASIcs.SpaceCHI.2025.32,
  author =	{Dogru, Pinar and Schnellb\"{a}cher, Hanjo and Battikh, Tarek Can and Remi\'{c}, Kristina},
  title =	{{Virtual Reality Prototyping Environment for Concurrent Design, Training and Rover Operations}},
  booktitle =	{Advancing Human-Computer Interaction for Space Exploration (SpaceCHI 2025)},
  pages =	{32:1--32:13},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-384-3},
  ISSN =	{2190-6807},
  year =	{2025},
  volume =	{130},
  editor =	{Bensch, Leonie and Nilsson, Tommy and Nisser, Martin and Pataranutaporn, Pat and Schmidt, Albrecht and Sumini, Valentina},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SpaceCHI.2025.32},
  URN =		{urn:nbn:de:0030-drops-240226},
  doi =		{10.4230/OASIcs.SpaceCHI.2025.32},
  annote =	{Keywords: virtual reality (VR), digital twin, human-robot-interaction (HRI), LUNA analog facility, rover, extravehicular activities (EVA), gamification, simulation, user-centered design (UCD), concurrent engineering (CE), space system engineering}
}
Document
Short Paper
DOI: 10.4230/LIPIcs.ITP.2019.36
Formalization of the Domination Chain with Weighted Parameters (Short Paper)

Authors: Daniel E. Severín

Published in: LIPIcs, Volume 141, 10th International Conference on Interactive Theorem Proving (ITP 2019)

Abstract
The Cockayne-Hedetniemi Domination Chain is a chain of inequalities between classic parameters of graph theory: for a given graph G, ir(G) <= gamma(G) <= iota(G) <= alpha(G) <= Gamma(G) <= IR(G). These parameters return the maximum/minimum cardinality of a set satisfying some property. However, they can be generalized for graphs with weighted vertices where the objective is to maximize/minimize the sum of weights of a set satisfying the same property, and the domination chain still holds for them. In this work, the definition of these parameters as well as the chain is formalized in Coq/Ssreflect.
Cite as

Daniel E. Severín. Formalization of the Domination Chain with Weighted Parameters (Short Paper). In 10th International Conference on Interactive Theorem Proving (ITP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 141, pp. 36:1-36:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@InProceedings{severin:LIPIcs.ITP.2019.36,
  author =	{Sever{\'\i}n, Daniel E.},
  title =	{{Formalization of the Domination Chain with Weighted Parameters}},
  booktitle =	{10th International Conference on Interactive Theorem Proving (ITP 2019)},
  pages =	{36:1--36:7},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-122-1},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{141},
  editor =	{Harrison, John and O'Leary, John and Tolmach, Andrew},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2019.36},
  URN =		{urn:nbn:de:0030-drops-110919},
  doi =		{10.4230/LIPIcs.ITP.2019.36},
  annote =	{Keywords: Domination Chain, Coq, Formalization of Mathematics}
}
  • Refine by Type
  • 3 Document/PDF
  • 2 Document/HTML

  • Refine by Publication Year
  • 2 2025
  • 1 2019

  • Refine by Author
  • 1 Antonopoulos, Antonis
  • 1 Battikh, Tarek Can
  • 1 Dogru, Pinar
  • 1 Kanellopoulos, Sotiris
  • 1 Leonardos, Nikos
  • Show More...

  • Refine by Series/Journal
  • 2 LIPIcs
  • 1 OASIcs

  • Refine by Classification
  • 1 Computing methodologies → Interactive simulation
  • 1 Human-centered computing → User centered design
  • 1 Human-centered computing → Virtual reality
  • 1 Mathematics of computing → Graph theory
  • 1 Theory of computation → Approximation algorithms analysis

  • Refine by Keyword
  • 1 Coq
  • 1 Domination Chain
  • 1 Envy minimization
  • 1 Fair division
  • 1 Formalization of Mathematics
  • Show More...

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

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