217 search results - page 40 / 44 » Parameterized algorithms for d-Hitting Set: The weighted cas... |
MP
1998
13 years 7 months ago
1998
We define the base polytope B(P, g) of a partially ordered set P and a supermodular function g on the ideals ofP as the convex hull of the incidence vectors of all linear extensio...
ICALP
2010
Springer
14 years 7 days ago
2010
Springer
A discrete distribution D over Σ1 × · · · × Σn is called (non-uniform) k-wise independent if for any set of k indexes {i1, . . . , ik} and for any z1 ∈ Σi1 , . . . , zk ...
MOBIHOC
2009
ACM
14 years 8 months ago
2009
ACM
Cognitive radio networks are emerging as a promising technology for the efficient use of radio spectrum. In these networks, there are two categories of networks on different chann...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
JOIN
2007
13 years 7 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...