A Fixed-Parameter Enumeration Algorithm for the Weighted FVS Problem

2009 ◽  
pp. 390-399
Author(s):  
Jianxin Wang ◽  
Guohong Jiang
Keyword(s):  
Enumeration Algorithm ◽  
Fixed Parameter

Fixed Parameter Enumeration Algorithm for Feedback Vertex Set in Weighted Undirected Graphs

2010 ◽  
Vol 33 (7) ◽  
pp. 1140-1152 ◽  
Author(s):  
Jian-Xin WANG ◽  
Guo-Hong JIANG ◽  
Jian-Er CHEN
Keyword(s):  
Undirected Graphs ◽  
Feedback Vertex Set ◽  
Enumeration Algorithm ◽  
Fixed Parameter ◽  
Vertex Set

scholarly journals Fixed-Parameter Extrapolation and Aperiodic Order

2018 ◽  
Vol 49 (3) ◽  
pp. 35-47
Author(s):  
Stephen Fenner ◽  
Frederic Green ◽  
Steven Homer
Keyword(s):  
Aperiodic Order ◽  
Fixed Parameter

The complexity of fixed-parameter problems

2008 ◽  
Vol 39 (1) ◽  
pp. 33-46 ◽  
Author(s):  
Jonathan F. Buss ◽  
Tarique M. Islam
Keyword(s):  
Fixed Parameter

scholarly journals Eisenstein series and an asymptotic for the K-Bessel function

2021 ◽  
Author(s):  
Jimmy Tseng
Keyword(s):  
Asymptotic Expansion ◽  
Bessel Function ◽  
Eisenstein Series ◽  
Uniform Estimate ◽  
Positive Real ◽  
Dominant Term ◽  
Complex Order ◽  
Fixed Parameter ◽  
Real Argument ◽  
Real Analytic

AbstractWe produce an estimate for the K-Bessel function $$K_{r + i t}(y)$$ K r + i t ( y ) with positive, real argument y and of large complex order $$r+it$$ r + i t where r is bounded and $$t = y \sin \theta $$ t = y sin θ for a fixed parameter $$0\le \theta \le \pi /2$$ 0 ≤ θ ≤ π / 2 or $$t= y \cosh \mu $$ t = y cosh μ for a fixed parameter $$\mu >0$$ μ > 0 . In particular, we compute the dominant term of the asymptotic expansion of $$K_{r + i t}(y)$$ K r + i t ( y ) as $$y \rightarrow \infty $$ y → ∞ . When t and y are close (or equal), we also give a uniform estimate. As an application of these estimates, we give bounds on the weight-zero (real-analytic) Eisenstein series $$E_0^{(j)}(z, r+it)$$ E 0 ( j ) ( z , r + i t ) for each inequivalent cusp $$\kappa _j$$ κ j when $$1/2 \le r \le 3/2$$ 1 / 2 ≤ r ≤ 3 / 2 .

scholarly journals Fixed-Parameter Algorithms for Unsplittable Flow Cover

2021 ◽  
Author(s):  
Andrés Cristi ◽  
Mathieu Mari ◽  
Andreas Wiese
Keyword(s):  
Fixed Parameter ◽  
Unsplittable Flow

scholarly journals Fixed-parameter tractability and lower bounds for stabbing problems

2013 ◽  
Vol 46 (7) ◽  
pp. 839-860 ◽  
Author(s):  
Panos Giannopoulos ◽  
Christian Knauer ◽  
Günter Rote ◽  
Daniel Werner
Keyword(s):  
Lower Bounds ◽  
Fixed Parameter Tractability ◽  
Fixed Parameter

On the complexity of fixed parameter problems

1989 ◽  
Author(s):  
K.R. Abrahamson ◽  
M.R. Fellows ◽  
J.A. Ellis ◽  
M.E. Mata
Keyword(s):  
Fixed Parameter

The Location Problem of Given and Indivisible Different Units

1970 ◽  
Vol 2 (3) ◽  
pp. 341-356
Author(s):  
G. Jándy
Keyword(s):  
Exact Solution ◽  
Heuristic Algorithm ◽  
Network Flow ◽  
Location Problem ◽  
Optimal Solution ◽  
Type Problem ◽  
Distribution Problem ◽  
Enumeration Algorithm ◽  
Weighted Distribution ◽  
Partial Enumeration

In cases where certain simplifications are allowed, the location optimisation of given and indivisible different economic units may be modelled as a bi-value weighted distribution problem. The paper presents a heuristic algorithm for this network-flow-type problem and also a partial enumeration algorithm for deriving the exact solution. But it is also pointed out that an initial sub-optimal solution can quickly be improved with a derivation on a direct line only, if the exact solution is not absolutely essential. A numerical example is used to illustrate the method of derivation on a direct line starting with an upper bound given by a sub-optimal solution.

Sign in / Sign up

Export Citation Format

Share Document