642 search results - page 77 / 129 » Approximation Algorithms for Minimum K-Cut |
100
click to vote
CIAC
2006
Springer
15 years 3 months ago
2006
Springer
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
WSC
2008
15 years 2 months ago
2008
Event based simulations are an important scientific application in many fields. With the rise of cluster computing, distributed event simulation optimization becomes an essential ...
JGTOOLS
2006
14 years 12 months ago
2006
Poisson Disk sampling patterns are of interest to the graphics community because their blue-noise properties are desirable in sampling patterns for rendering, illumination, and ot...
IACR
2011
13 years 11 months ago
2011
Given a lattice L with the i-th successive minimum λi, its i-th gap λi λ1 often provides useful information for analyzing the security of cryptographic schemes related to L. The...
107
click to vote
STACS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...