934 search results - page 133 / 187 » A theoretical analysis of the HIFF problem |
JCM
2007
14 years 9 months ago
2007
Abstract— Wavelength is one of the most important resources in Wavelength Division Multiplexing(WDM) networks. In optical routing, we are given a set of communication paths (or l...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
MFCS
2001
Springer
15 years 2 months ago
2001
Springer
In the traveling repairman problem (Trp), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of ...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...