3678 search results - page 555 / 736 » On the Stable Paths Problem |
131
click to vote
DAM
2011
14 years 11 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
161
click to vote
JSAC
2011
14 years 11 months ago
2011
Wireless vehicular ad hoc networks are characterized by multi-hop transmission, where a key problem is the design of routing, e.g., how to efficiently direct the information flo...
159
click to vote
DASFAA
2011
IEEE
14 years 7 months ago
2011
IEEE
Abstract. Uncertainty is inherently ubiquitous in data of real applications, and those uncertain data can be naturally represented by the XML. Matching twig pattern against XML dat...
154
click to vote
CIE
2007
Springer
15 years 10 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
123
click to vote
WAOA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We consider a Stackelberg pricing problem in directed networks. Tariffs have to be defined by an operator, the leader, for a subset of the arcs, the tariff arcs. Clien...