Results 61 to 70 of about 10,477 (184)
, 1992 An automaton A=(S,Σ,M) is said to be R-strongly connected if for every s∈S,R(s)=(r(s),Σ,Ms) i strongly connected, where r(s)={M(s,x)|x∈Σ+} and Ms is the map M restricted to r(s)×Σ.
Zhang, Shuhua
core +1 more source
Algorithms for the rainbow vertex coloring problem on graph classes
, 2020 Given a vertex-colored graph, we say a path is a rainbow vertex path if all its internal vertices have distinct colors. The graph is rainbow vertex-connected if there is a rainbow vertex path between every pair of its vertices.
Lima, Paloma T. +6 more
core +1 more source
Polynomial-time algorithms for computing distances of Fuzzy Transition Systems [PDF]
, 2018 Behaviour distances to measure the resemblance of two states in a (nondeterministic) fuzzy transition system have been proposed recently in literature.
Cao, Y. +5 more
core +1 more source
Strongly Polynomial and Fully Combinatorial Algorithms for Bisubmodular Function Minimization
, 2007 Bisubmodular functions are a natural “directed”, or “signed”, extension of submodular functions with several applications. Recently Fujishige and Iwata showed how to extend the Iwata, Fleischer, and Fujishige (IFF) algorithm for submodular function ...
S. Thomas McCormick, Satoru Fujishige
core
Polynomial combinatorial algorithms for skew-bisubmodular function minimization [PDF]
, 2017 Huber et al. (SIAM J Comput 43:1064–1084, 2014) introduced a concept of skew bisubmodularity, as a generalization of bisubmodularity, in their complexity dichotomy theorem for valued constraint satisfaction problems over the three-value domain, and Huber
Satoru Fujishige +5 more
core +1 more source
Tractability of Approximation of Functions Defined over Weighted Hilbert Spaces
AxiomsWe investigate L2-approximation problems in the worst case setting in the weighted Hilbert spaces H(KRd,α,γ) with weights Rd,α,γ under parameters 1≥γ1≥γ2≥⋯≥0 and 11 and t2>0 in terms of the introduced weights under the absolute error criterion or the ...
Huichao Yan, Jia Chen
doaj +1 more source
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
Journal of Combinatorial Theory, Series B, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +5 more sources
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
CoRR, 2018 The theory of $n$-fold integer programming has been recently emerging as an important tool in parameterized complexity. The input to an $n$-fold integer program (IP) consists of parameter $A$, dimension $n$, and numerical data of binary encoding length $L$.
Martin Koutecký, Asaf Levin, Shmuel Onn
openaire +4 more sources
Strongly polynomial-time truthful mechanisms in one shot
, 2009 One of the main challenges in algorithmic mechanism design is to turn (existing) efficient algorithmic solutions into efficient truthful mechanisms. Building a truthful mechanism is indeed a difficult process since the underlying algorithm must obey ...
P. PENNA +4 more
core +1 more source
A strongly polynomial-time algorithm for minimizing submodular functions
, 1999 This paper presents a combinatorial polynomial-time algorithm for minimizing submolular set functions. The algorithm employs a scaling scheme that uses a flow in the complete directed graph on the underlying set with each arc capacity equal to the scaled
Fleischer, Lisa +2 more
core