Results 81 to 90 of about 23,779 (205)
Ural Mathematical Journal, 2016 The Hitting Set Problem (HSP) is the well known extremal problem adopting research interest in the fields of combinatorial optimization, computational geometry, and statistical learning theory for decades.
Daniel M. Khachay, Michael Yu. Khachay
doaj +1 more source
Parameterized Complexity of Sparse Linear Complementarity Problems [PDF]
, 2015 In this paper, we study the parameterized complexity of the linear complementarity problem (LCP), which is one of the most fundamental mathematical optimization problems.
Makino, Kazuhisa +2 more
core +1 more source
Parameterized complexity of conflict-free graph coloring [PDF]
, 2019 Given a graph G, a q-open neighborhood conflict-free coloring or q-ONCF-coloring is a vertex coloring c: V(G) → { 1, 2, …, q} such that for each vertex v∈ V(G) there is a vertex in N(v) that is uniquely colored from the rest of the vertices in N(v). When
Friggstad, Zachary +11 more
core +1 more source
Collective Graph Exploration Parameterized by Vertex Cover [PDF]
, 2023 We initiate the study of the parameterized complexity of the Collective Graph Exploration (CGE) problem. In CGE, the input consists of an undirected connected graph G and a collection of k robots, initially placed at the same vertex r of G, and each one ...
Sa'ar, Guy +2 more
core +1 more source
Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability
Algorithms, 2012 The problem of finding the maximum number of vertex-disjoint uni-color paths in an edge-colored graph has been recently introduced in literature, motivated by applications in social network analysis.
Yuri Pirola +2 more
doaj +1 more source
Parameterized Valiant’s Classes [PDF]
, 2019 We define a theory of parameterized algebraic complexity classes in analogy to parameterized Boolean counting classes. We define the classes VFPT and VW[t], which mirror the Boolean counting classes #FPT and #W[t], and define appropriate reductions and ...
Bläser, Markus, Engels, Christian
core +1 more source
SensorsIn recent years, ambient intelligence (AmI) has gained significant attention from both academia and industry. AmI seeks to create environments that automatically adapt to individuals’ needs, improving comfort and efficiency.
Alessandro Aloisio +3 more
doaj +1 more source
Architecture and Engineering, 2019 Introduction: As a research focus in the construction industry in recent years, prefabricated structures have advantages such as environmentally friendly and economical and so on, but it also increases the complexity of design and construction and the ...
Qinghan Bai +3 more
doaj +1 more source
On the Parameterized Complexity of Clique Elimination Distance [PDF]
, 2020 Bulian and Dawar [Algorithmica, 2016] introduced the notion of elimination distance in an effort to define new tractable parameterizations for graph problems and showed that deciding whether a given graph has elimination distance at most k to any minor ...
Agrawal, Akanksha, Ramanujan, M. S.
core +1 more source
Parameterized Complexity of Untangling Knots
SIAM Journal on ComputingDeciding whether a diagram of a knot can be untangled with a given number of moves (as a part of the input) is known to be NP-complete. In this paper we determine the parameterized complexity of this problem with respect to a natural parameter called defect.
Clément Legrand-Duchesne +2 more
openaire +4 more sources