642 search results - page 16 / 129 » Approximation Algorithms for Minimum K-Cut |
113
click to vote
STACS
2007
Springer
15 years 5 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
115
click to vote
NETWORKS
2002
14 years 11 months ago
2002
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
ESA
2005
Springer
15 years 5 months ago
2005
Springer
The input to the minimum latency set cover problem (MLSC) consists of a set of jobs and a set of tools. Each job j needs a specific subset Sj of the tools in order to be processed...
SIAMJO
2008
14 years 11 months ago
2008
Given A := {a1, . . . , am} Rn, we consider the problem of reducing the input set for the computation of the minimum enclosing ball of A. In this note, given an approximate soluti...
122
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...