Call Control with k Rejections

Anand, Rohit; Erlebach, Thomas; Hall, Alexander; Stefanakos, Stamatis

doi:10.1007/3-540-45471-3_32

Cited by 4 publications

(6 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In fact, we could use the ideas originating from the present paper to improve on the running times, see [14,16]. • Networks: Call control problems were introduced and studied in a parameterized framework [5]. Specifically, CALL CONTROL IN A TREE OF RINGS (with unit capacities) can be solved with the help of 3HS, this way improving on the algorithm presented there.…”

mentioning

confidence: 95%

A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set

Fernau

2008

Algorithmica

View full text Add to dashboard Cite

In this paper, we show how to systematically improve on parameterized algorithms and their analysis, focusing on search-tree based algorithms for 3-HITTING SET. We concentrate on algorithms which are easy to implement, in contrast with the highly sophisticated algorithms which have been designed previously to improve on the exponential base in the algorithms.However, this necessitates a more complex algorithm analysis based on a so-called auxiliary parameter, a technique which we believe can be used in other circumstances, as well.

show abstract

mentioning

confidence: 95%

A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set

Fernau

2008

Algorithmica

View full text Add to dashboard Cite

show abstract

“…The mathematically most demanding part, however, is to show that few simple and efficient data reduction rules running in polynomial time lead to a problem kernel. Finally, we mention in passing that Anand et al [4] proved a fixedparameter tractability result for the related multicommodity flow problem in trees. More specifically, for the parameter l referring to the "rejected flows," they have the combinatorial explosion 2 l l!…”

Section: Preliminariesmentioning

confidence: 95%

Fixed‐parameter tractability and data reduction for multicut in trees

Guo

Niedermeier

2005

Networks

View full text Add to dashboard Cite

We study an NP-complete (and MaxSNP-hard) communication problem on tree networks, the so-called Multicut in Trees: given an undirected tree and some pairs of nodes of the tree, find out whether there is a set of at most k tree edges whose removal separates all given pairs of nodes. Multicut has been intensively studied for trees as well as for general graphs mainly from the viewpoint of polynomialtime approximation algorithms. By way of contrast, we provide a

show abstract

“…Both papers, however, concentrate on the polynomial-time approximability of MDFT and its still NP-complete special cases. Concerning exact algorithms, we are only aware of the recent work of Anand et al [1] where (a special case of) MDFT is referred to as "call admission control problem". For the special case of MDFT restricted to instances with unit demands and unit profits, they presented a fixed-parameter algorithm with running time O(2 d · d!…”

Section: Inputmentioning

confidence: 99%