[PDF] Top 20 The Directed Steiner Network problem is tractable for a constant number of terminals
Has 10000 "The Directed Steiner Network problem is tractable for a constant number of terminals" found on our website. Below are the top 20 most common "The Directed Steiner Network problem is tractable for a constant number of terminals".
The Directed Steiner Network problem is tractable for a constant number of terminals
... the STRONGLY CONNECTED STEINER SUBGRAPH problem for any constant p, where given a directed graph and p nodes in the graph, one has to compute the smallest strongly[r] ... Voir le document complet
38
A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps
... [15], the Steiner Network problem is W[2]-hard when parameterized by the size of the solution (as a consequence of the results of ... Voir le document complet
16
Constant Thresholds Can Make Target Set Selection Tractable
... which is a prominent NP-hard problem occurring in social network analysis and distributed computing, is notoriously hard both in terms of achieving useful approximation as well ... Voir le document complet
23
On the edge capacitated Steiner tree problem
... exists, a minimum-length directed tree S rooted at r, that spans all the vertices of T and does not violate the capacity ...E) is undirected and e = (u, v) is an arc ... Voir le document complet
32
A phase-field approximation of the Steiner problem in dimension two
... introduce a phase-field approximation of a branched transportation energy for lines in the plane ...goal is to derive a computationally tractable approximation ... Voir le document complet
29
On the (di)graphs with (directed) proper connection number two
... all the parties connected and the goal is to maximize ...it is sometimes impossible to transmit a signal directly between, say, two communication towers A and ...Thus, the ... Voir le document complet
21
On the (di)graphs with (directed) proper connection number two
... study a relaxed variant of proper colorings, introduced by Borozan et ...impose for every two vertices u, v to have a properly colored (di)path from u to v – the (di)graph itself may ... Voir le document complet
7
A Microstructure-based Family of Tractable Classes for CSPs
... Some of the instances are solved efficiently by MAC in a backtrack-free manner even though they do not belong to one of the studied tractable ...consider the notion ... Voir le document complet
16
The quantum separability problem is a simultaneous hollowisation matrix analysis problem
... entanglement is at the heart of quantum me- chanics and intimately linked to its nonlocal feature ...It is a key resource in many promising applications, like, to cite a few, ... Voir le document complet
6
Mathematical Formulation for the Network Slice Design Problem
... calculate the exact amount of dis- tributed centralized NFSs for each NS ...It is important to mention that, to minimize the residual virtual resources from each NFS, this amount might ... Voir le document complet
5
Self-assemblying (classes of) shapes with a constant number of tiles.
... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ... Voir le document complet
15
Sequences with constant number of return words
... k−1 is a return word of w. The set of all return words of w is denoted by R(w), R(w) = {u j u j+1 ...occurrences of w in u}. If v is a return word ... Voir le document complet
10
Hamilton Circuits in the Directed Butterfly Network
... Hamilton circuits in the directed Butterfly network Jean-Claude Bermond, Eric Darrot, Olivier Delmas, Ste´phane Perennes The`me 1 — Re´seaux et syste`mes Projet SLOOP Rapport de recherch[r] ... Voir le document complet
28
Optipris : A constant pressure air intake for a Mach number up to 0.3
... within the framework of the Optipris project whose goal is to develop high-performance air ...Most of the time, air intakes are located in regions of negative pressure ... Voir le document complet
3
Kernelizations for the hybridization number problem on multiple nonbinary trees
... challenge is to construct a plausible evolutionary history for a set of contemporary species X given incomplete ...but the paradigm is equally applicable to more abstract ... Voir le document complet
32
The finiteness problem for automaton semigroups is undecidable
... It is undecidable whether or not a one-dimensional cellular automaton is ...nilpotent. The argument can be adapted to automaton semigroups, however we need to be careful about a side ... Voir le document complet
9
Extended Cutset Inequalities for the Network Power Consumption Problem
... because of the cutset inequality ( 5 ...WOC is deployed (in S). If no WOC is deployed, the latter one strictly dominates the first and vice versa if more than one WOC is ... Voir le document complet
9
On the robustness of fishman's bound-based method for the network reliability problem
... Static network unreliability computation is an NP-hard problem, leading to the use of Monte Carlo techniques to estimate ...it. The latter, in turn, suffer from the rare ... Voir le document complet
13
An analog device for solving the approximation problem of network synthesis
... Fig.. Currents are introduced into the conducting plane by means of current probes. These probes are simply steel needles mounted in polystyrene holders. Ideally the[r] ... Voir le document complet
52
The auction algorithm for the minimum cost network flow problem
... To show that the number of substantive price rises per iteration is finite, note that with each substantive price rise, the reject capacity of either node i or a n[r] ... Voir le document complet
32
Sujets connexes