12519 search results - page 83 / 2504 » Approximation Problems Categories |
142
click to vote
IPL
2007
15 years 6 months ago
2007
We observe that combining the techniques of Arora, Rao, and Vazirani, with the rounding algorithm of Rao and Richa yields an O( √ log n log log n)-approximation for the minimum-...
178
click to vote
ALGORITHMICA
2004
15 years 6 months ago
2004
We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...
147
click to vote
WADS
2007
Springer
16 years 9 days ago
2007
Springer
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...
159
click to vote
JCAM
2011
14 years 9 months ago
2011
In this paper we discuss multiperiod portfolio selection problems related to a speci…c provisioning problem. Our results are an extension of Dhaene et al. (2005), where optimal ...
126
click to vote
4OR
2008
15 years 6 months ago
2008
This is a summary of the author's PhD thesis supervised by Marie-Christine Costa and Fr