523 search results - page 46 / 105 » Improved Approximation Algorithms for Maximum Graph Partitio... |
130
Voted
JAIR
1998
15 years 4 months ago
1998
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
156
click to vote
ESA
2007
Springer
15 years 9 months ago
2007
Springer
We consider the problem of pricing items so as to maximize the profit made from selling these items. An instance is given by a set E of n items and a set of m clients, where each c...
180
click to vote
MEMICS
2010
14 years 12 months ago
2010
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This alg...
160
click to vote
WG
2007
Springer
15 years 11 months ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
123
click to vote
APPROX
2007
Springer
15 years 11 months ago
2007
Springer
abstract Manor Mendel1 and Assaf Naor2 1 The Open University of Israel 2 Courant Institute Let (X, dX ) be an n-point metric space. We show that there exists a distribution D over ...