354 search results - page 60 / 71 » Algorithms for the Minimum Edge Cover of H-Subgraphs of a Gr... |
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— Network tomography infers internal network characteristics by sending and collecting probe packets from the network edge. Traditional tomographic techniques for general...
STACS
2009
Springer
14 years 2 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...
ICFCA
2004
Springer
14 years 24 days ago
2004
Springer
Lattice diagrams, known as Hasse diagrams, have played an ever increasing role in lattice theory and fields that use lattices as a tool. Initially regarded with suspicion, they no...
FUN
2007
Springer
13 years 11 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...