Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Triommatis, Theofilos"'
Imagine a polygon-shaped platform $P$ and only one static spotlight outside $P$; which direction should the spotlight face to light most of $P$? This problem occurs in maximising the visibility, as well as in limiting the uncertainty in localisation
Externí odkaz:
http://arxiv.org/abs/2309.15573
A graph $G$ is \emph{locally irregular} if no two of its adjacent vertices have the same degree. In [Fioravantes et al. Complexity of finding maximum locally irregular induced subgraph. {\it SWAT}, 2022], the authors introduced and studied the proble
Externí odkaz:
http://arxiv.org/abs/2307.04583
In this paper, we present a geometric framework for the passive localisation of static emitters. The objective is to localise the position of the emitters in a given area by centralised coordination of mobile passive sensors. This framework uses only
Externí odkaz:
http://arxiv.org/abs/2207.13396
We consider the Subset Sum Ratio Problem ($SSR$), in which given a set of integers the goal is to find two subsets such that the ratio of their sums is as close to~1 as possible, and introduce a family of variations that capture additional meaningful
Externí odkaz:
http://arxiv.org/abs/2003.06622
In this paper, we study the problem of counting the number of different knapsack solutions with a prescribed cardinality. We present an FPTAS for this problem, based on dynamic programming. We also introduce two different types of semi-fair allocatio
Externí odkaz:
http://arxiv.org/abs/1912.12430
Publikováno v:
In Theoretical Computer Science 29 September 2022 931:17-30
Publikováno v:
[Research Report] Inria; I3S; Université Côte d'Azur. 2021
Scandinavian Symposium and Workshops on Algorithm Theory (SWAT) 2022
Scandinavian Symposium and Workshops on Algorithm Theory (SWAT) 2022, Jun 2022, Torshavn, Faroe Islands. ⟨10.4230/LIPIcs.SWAT.2022.23⟩
Scandinavian Symposium and Workshops on Algorithm Theory (SWAT) 2022
Scandinavian Symposium and Workshops on Algorithm Theory (SWAT) 2022, Jun 2022, Torshavn, Faroe Islands. ⟨10.4230/LIPIcs.SWAT.2022.23⟩
If a graph G is such that no two adjacent vertices of G have the same degree, we say that G is locally irregular. In this work we introduce and study the problem of identifying a largest induced subgraph of a given graph G that is locally irregular.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8aad280c8db6a41199f6ce60306b74a1
This book constitutes the refereed proceedings of the 16th Annual Conference on Theory and Applications of Models of Computation, TAMC 2020, held in Changsha, China, in October 2020. The 37 full papers were carefully reviewed and selected from 83 sub
Autor:
Minming Li
This book constitutes the proceedings of the 14th International Workshop on Frontiers in Algorithmics, FAW 2020, held in Haikou, China, in May 2020. The conference was held virtually due to the COVID-19 pandemic. The 12 full papers presented in this