Results 1 
7 of
7
Approximation Algorithms for Disjoint Paths Problems
, 1996
"... The construction of disjoint paths in a network is a basic issue in combinatorial optimization: given a network, and specified pairs of nodes in it, we are interested in finding disjoint paths between as many of these pairs as possible. This leads to a variety of classical NPcomplete problems for w ..."
Abstract

Cited by 166 (0 self)
 Add to MetaCart
The construction of disjoint paths in a network is a basic issue in combinatorial optimization: given a network, and specified pairs of nodes in it, we are interested in finding disjoint paths between as many of these pairs as possible. This leads to a variety of classical NPcomplete problems for which very little is known from the point of view of approximation algorithms. It has recently been brought into focus in work on problems such as VLSI layout and routing in highspeed networks; in these settings, the current lack of understanding of the disjoint paths problem is often an obstacle to the design of practical heuristics.
Economics
"... Abstract: Consider two parallel planar grids of size w×n. The vertices of these grids are called terminals and pairwise disjoint subsets of terminals are called nets. We aim at routing all nets in a cubic grid between the two layers holding the terminals. However, to ensure solvability, it is allowe ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
Abstract: Consider two parallel planar grids of size w×n. The vertices of these grids are called terminals and pairwise disjoint subsets of terminals are called nets. We aim at routing all nets in a cubic grid between the two layers holding the terminals. However, to ensure solvability, it is allowed to introduce an empty row/column between every two consecutive rows/columns containing the terminals (in both grids). Hence the routing is to be realized in a cubic grid of size 2n × 2w × h. The objective is to minimize the height h. In this paper we generalize previous results of Recski and Szeszlér [10] and show that every problem instance is solvable in polynomial time with height h = O(max(n,w)). This linear bound is best possible (apart from a constant factor).
Quality of Authentication in Ad Hoc Networks
"... Abstract — With the emergence of ad hoc networking technology came efforts to provide necessary security support for ad hoc networks. However, due to challenging characteristics of ad hoc environments, providing the same level of security as in wired networks is often very difficult if not impossibl ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Abstract — With the emergence of ad hoc networking technology came efforts to provide necessary security support for ad hoc networks. However, due to challenging characteristics of ad hoc environments, providing the same level of security as in wired networks is often very difficult if not impossible. A more viable way to approach this challenge is to maximize the utility of the achievable security instead of trying to achieve perfect security at a prohibitive cost. To this end, we propose a SituationAware Security paradigm. A situationaware security service provides bestachievable service and the clients of the service constantly measure the level of the currently provided service. We apply this new paradigm to one of the most fundamental security services: authentication. Most proposed solutions measure their utility using only success ratio, which cannot fully measure the quality of the authentication service and often leads to a false sense of security. Therefore, we propose the missing part of the metric, the Quality of Authentication (QoA). QoA encapsulates the current situation that the authentication service operates in, which is expressed as the level of confidence an authenticating entity can put on the target entity. QoA combined with success ratio can provide a complete evaluation of an authentication service. We evaluate existing ad hoc key management frameworks with an extensive simulation study and combinatorial analysis of the framework designs to show the utility of QoA, including the discovery of previously hidden flaws of existing designs and a comprehensive comparison between several different approaches. I.
Routing vertex disjoint Steinertrees in a cubic grid — an application
"... connections to VLSI ..."
(Show Context)
unknown title
, 2004
"... www.elsevier.com/locate/tcs Complexity of pairwise shortest path routing in the grid ..."
Abstract
 Add to MetaCart
(Show Context)
www.elsevier.com/locate/tcs Complexity of pairwise shortest path routing in the grid
2.1 Setting of the Problem...................... 6
"... Alulírott Szeszlér Dávid kijelentem, hogy ezt a doktori értekezést magam készítettem és abban csak a megadott forrásokat használtam fel. Minden olyan részt, amelyet szó szerint, vagy azonos tartalommal, de átfogalmazva más forrásból átvettem, egyértelműen, a forrás megadásával megjelöltem. 2 ..."
Abstract
 Add to MetaCart
(Show Context)
Alulírott Szeszlér Dávid kijelentem, hogy ezt a doktori értekezést magam készítettem és abban csak a megadott forrásokat használtam fel. Minden olyan részt, amelyet szó szerint, vagy azonos tartalommal, de átfogalmazva más forrásból átvettem, egyértelműen, a forrás megadásával megjelöltem. 2