1963 search results - page 163 / 393 » The Maximum Solution Problem on Graphs |
120
click to vote
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...
123
click to vote
SIROCCO
2001
15 years 3 months ago
2001
This paper considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other. We focus on...
131
Voted
CIE
2007
Springer
15 years 8 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....
137
click to vote
CVPR
2005
IEEE
16 years 4 months ago
2005
IEEE
Object detection is challenging partly due to the limited discriminative power of local feature descriptors. We amend this limitation by incorporating spatial constraints among ne...
117
click to vote
TPDS
2008
15 years 2 months ago
2008
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...