909 search results - page 37 / 182 » On the approximability of some network design problems |
126
click to vote
SODA
1998
ACM
15 years 2 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
132
Voted
CORR
2011
Springer
14 years 8 months ago
2011
Springer
Following a polynomial approach, many robust fixed-order controller design problems can be formulated as optimization problems whose set of feasible solutions is modelled by para...
123
click to vote
OPODIS
2007
15 years 2 months ago
2007
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way tha...
125
click to vote
WINE
2007
Springer
15 years 7 months ago
2007
Springer
We introduce the concept of a trust network—a decentralized payment infrastructure in which payments are routed as IOUs between trusted entities. The trust network has directed ...
136
click to vote
TON
2008
15 years 1 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...