41 search results - page 6 / 9 » Approximate Integer Decompositions for Undirected Network De... |
97
Voted
MP
1998
14 years 11 months ago
1998
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
104
Voted
SODA
1998
ACM
15 years 1 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...
146
click to vote
STOC
2007
ACM
15 years 12 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
96
Voted
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— In a wireless mesh network (WMN) with a number of stationary wireless routers, the aggregate capacity can be increased when each router is equipped with multiple network interf...
117
click to vote
WADS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...