<--- Back to Details
First PageDocument Content
NP-complete problems / Travelling salesman problem / Induced path / Shortest path problem / Graph / Routing / Combinatorial optimization / Path / Hamiltonian path / Graph theory / Theoretical computer science / Mathematics
Date: 2014-04-22 07:57:30
NP-complete problems
Travelling salesman problem
Induced path
Shortest path problem
Graph
Routing
Combinatorial optimization
Path
Hamiltonian path
Graph theory
Theoretical computer science
Mathematics

Optimization of Cable Cycles: A Trade-off between Reliability and Cost Master Thesis in Micro-data Analysis Author: Barsam Payvar

Add to Reading List

Source URL: www.statistics.du.se

Download Document from Source Website

File Size: 1,36 MB

Share Document on Facebook

Similar Documents

Efficient Traffic Routing with Progress Guarantees Stefan Blumer Manuel Eichelberger  Roger Wattenhofer

Efficient Traffic Routing with Progress Guarantees Stefan Blumer Manuel Eichelberger Roger Wattenhofer

DocID: 1xVZy - View Document

Sweet Little Lies: Fake Topologies for Flexible Routing Stefano Vissicchio University of Louvain

Sweet Little Lies: Fake Topologies for Flexible Routing Stefano Vissicchio University of Louvain

DocID: 1xVPP - View Document

Decoy Routing: Toward Unblockable Internet Communication Josh Karlin  Daniel Ellard

Decoy Routing: Toward Unblockable Internet Communication Josh Karlin Daniel Ellard

DocID: 1xVLC - View Document

Hijacking Bitcoin: Routing Attacks on Cryptocurrencies https://btc-hijack.ethz.ch Maria Apostolaki  Aviv Zohar

Hijacking Bitcoin: Routing Attacks on Cryptocurrencies https://btc-hijack.ethz.ch Maria Apostolaki Aviv Zohar

DocID: 1xVI1 - View Document

Wheel + Ring = Reel: the Impact of Route Filtering on the Stability of Policy Routing Luca Cittadini Giuseppe Di Battista

Wheel + Ring = Reel: the Impact of Route Filtering on the Stability of Policy Routing Luca Cittadini Giuseppe Di Battista

DocID: 1xVsm - View Document