743 search results - page 65 / 149 » Approximation Algorithms for Graph Homomorphism Problems |
134
click to vote
COMPGEOM
2005
ACM
15 years 4 months ago
2005
ACM
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
140
Voted
MEMICS
2010
14 years 9 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...
134
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
107
click to vote
WINE
2005
Springer
15 years 7 months ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
112
click to vote
SOFSEM
2007
Springer
15 years 8 months ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...