534 search results - page 21 / 107 » Tight approximation algorithm for connectivity augmentation ... |
145
click to vote
GLOBECOM
2006
IEEE
15 years 12 months ago
2006
IEEE
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...
189
click to vote
MOBIHOC
2002
ACM
16 years 5 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
180
click to vote
IPCO
2007
15 years 7 months ago
2007
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
220
click to vote
OL
2011
15 years 24 days ago
2011
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
170
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...