369 search results - page 25 / 74 » Approximation Algorithms for the Bi-criteria Weighted max-cu... |
118
click to vote
ESA
2006
Springer
15 years 5 months ago
2006
Springer
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
128
click to vote
IPL
2007
15 years 1 months ago
2007
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...
101
click to vote
SODA
1997
ACM
15 years 3 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
137
click to vote
ESA
2008
Springer
15 years 3 months ago
2008
Springer
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...
112
click to vote
JC
2008
15 years 1 months ago
2008
We study multivariate approximation for continuous functions in the average case setting. The space of d variate continuous functions is equipped with the zero mean Gaussian measu...