3875 search results - page 4 / 775 » Approximation algorithms for the 0-extension problem |
JAL
2002
13 years 5 months ago
2002
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...
DAM
2000
13 years 5 months ago
2000
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to
SIAMSC
2011
13 years 27 days ago
2011
We consider the problem of estimating the uncertainty in large-scale linear statistical inverse problems with high-dimensional parameter spaces within the framework of Bayesian inf...
WINE
2010
Springer
13 years 3 months ago
2010
Springer
We consider profit-maximization problems for combinatorial auctions with non-single minded valuation functions and limited supply. We obtain fairly general results that relate the ...
SODA
2012
ACM
11 years 8 months ago
2012
ACM