2862 search results - page 3 / 573 » Bicriteria Network Design Problems |
APPROX
2008
Springer
13 years 9 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...
ICSM
2009
IEEE
13 years 5 months ago
2009
IEEE
Planning the next release in software release planning addresses the problem of assigning features to the next release such that technical, resource, risk, and budget constraints ...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
PODS
2008
ACM
14 years 7 months ago
2008
ACM
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
IJCNN
2000
IEEE
13 years 11 months ago
2000
IEEE
The generalized maze problem has been considered as an interesting testbed by various researchers in AI and neural networks. The most significantresults, fiom a neural networks po...