Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,081
Performance of repetition codes and punctured codes for accumulative broadcast
- in Proc. Modeling Optimization in Mobile, Ad Hoc Wireless Networks Workshop (WiOpt’03
, 2003
"... In the problem of minimum-energy broadcasting in a wireless network, the objective is to broadcast data reliably to all network nodes at a fixed rate with minimum transmitted power. In [3], this problem was formulated as a minimum-cost broadcast tree problem and the well-known heuristic for construc ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
In the problem of minimum-energy broadcasting in a wireless network, the objective is to broadcast data reliably to all network nodes at a fixed rate with minimum transmitted power. In [3], this problem was formulated as a minimum-cost broadcast tree problem and the well-known heuristic
Minimum-Cost Multicast over Coded Packet Networks
- IEEE TRANS. ON INF. THE
, 2006
"... We consider the problem of establishing minimum-cost multicast connections over coded packet networks, i.e., packet networks where the contents of outgoing packets are arbitrary, causal functions of the contents of received packets. We consider both wireline and wireless packet networks as well as b ..."
Abstract
-
Cited by 164 (28 self)
- Add to MetaCart
We consider the problem of establishing minimum-cost multicast connections over coded packet networks, i.e., packet networks where the contents of outgoing packets are arbitrary, causal functions of the contents of received packets. We consider both wireline and wireless packet networks as well
A general approximation technique for constrained forest problems
- SIAM J. COMPUT.
, 1995
"... We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph with trees, cycles, or paths satisfying certain requirements. In particular, many basic combinatorial optimization proble ..."
Abstract
-
Cited by 414 (21 self)
- Add to MetaCart
problems fit in this framework, including the shortest path, minimum-cost spanning tree, minimum-weight perfect matching, traveling salesman, and Steiner tree problems. Our technique produces approximation algorithms that run in O(n log n) time and come within a factor of 2 of optimal for most
Complexity of finding embeddings in a k-tree
- SIAM JOURNAL OF DISCRETE MATHEMATICS
, 1987
"... A k-tree is a graph that can be reduced to the k-complete graph by a sequence of removals of a degree k vertex with completely connected neighbors. We address the problem of determining whether a graph is a partial graph of a k-tree. This problem is motivated by the existence of polynomial time al ..."
Abstract
-
Cited by 386 (1 self)
- Add to MetaCart
algorithms for many combinatorial problems on graphs when the graph is constrained to be a partial k-tree for fixed k. These algorithms have practical applications in areas such as reliability, concurrent broadcasting and evaluation of queries in a relational database system. We determine the complexity
A Data Structure for Dynamic Trees
, 1983
"... A data structure is proposed to maintain a collection of vertex-disjoint trees under a sequence of two kinds of operations: a link operation that combines two trees into one by adding an edge, and a cut operation that divides one tree into two by deleting an edge. Each operation requires O(log n) ti ..."
Abstract
-
Cited by 347 (21 self)
- Add to MetaCart
trees. (4) Implementing the network simplex algorithm for minimum-cost flows. The most significant application is (2); an O(mn log n)-time algorithm is obtained to find a maximum flow in a network of n vertices and m edges, beating by a factor of log n the fastest algorithm previously known for sparse
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Journal of the ACM
, 1998
"... Abstract. We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed c Ͼ 1 and given any n nodes in 2 , a randomized version of the scheme finds a (1 ϩ 1/c)-approximation to the optimum traveling salesman tour in O(n(log n) O(c) ) time. When the nodes ..."
Abstract
-
Cited by 397 (2 self)
- Add to MetaCart
to Christofides) achieves a 3/2-approximation in polynomial time. We also give similar approximation schemes for some other NP-hard Euclidean problems: Minimum Steiner Tree, k-TSP, and k-MST. (The running times of the algorithm for k-TSP and k-MST involve an additional multiplicative factor k.) The previous best
Achieving Minimum-Cost Multicast: A Decentralized Approach Based on Network Coding
- IN PROCEEDINGS OF IEEE INFOCOM
, 2005
"... We present decentralized algorithms that compute minimum-cost subgraphs for establishing multicast connections in networks that use coding. These algorithms, coupled with existing decentralized schemes for constructing network codes, constitute a fully decentralized approach for achieving minimum-co ..."
Abstract
-
Cited by 115 (15 self)
- Add to MetaCart
We present decentralized algorithms that compute minimum-cost subgraphs for establishing multicast connections in networks that use coding. These algorithms, coupled with existing decentralized schemes for constructing network codes, constitute a fully decentralized approach for achieving minimum-cost
When trees collide: An approximation algorithm for the generalized Steiner problem on networks
, 1994
"... We give the first approximation algorithm for the generalized network Steiner problem, a problem in network design. An instance consists of a network with link-costs and, for each pair fi; jg of nodes, an edge-connectivity requirement r ij . The goal is to find a minimum-cost network using the a ..."
Abstract
-
Cited by 249 (38 self)
- Add to MetaCart
We give the first approximation algorithm for the generalized network Steiner problem, a problem in network design. An instance consists of a network with link-costs and, for each pair fi; jg of nodes, an edge-connectivity requirement r ij . The goal is to find a minimum-cost network using
Finding Minimum-Cost Flows by Double Scaling
- MATHEMATICAL PROGRAMMING
, 1992
"... Several researchers have recently developed new techniques that give fast algorithms for the minimum-cost flow problem. In this paper we combine several of these techniques to yield an algorithm running in O(nm log log U log(nC)) time on networks with n vertices, m arcs, maximum arc capacity U, and ..."
Abstract
-
Cited by 34 (7 self)
- Add to MetaCart
Several researchers have recently developed new techniques that give fast algorithms for the minimum-cost flow problem. In this paper we combine several of these techniques to yield an algorithm running in O(nm log log U log(nC)) time on networks with n vertices, m arcs, maximum arc capacity U
Minimum-Cost Spanning Tree as a Path-Finding Problem
- Information Processing Letters
, 1994
"... In this paper we show that minimum-cost spanning tree is a special case of the closed semiring path-finding problem. This observation gives us a non-recursive algorithm for finding minimumcost spanning trees on mesh-connected computers that has the same asymptotic running time but is much simpler th ..."
Abstract
-
Cited by 18 (1 self)
- Add to MetaCart
In this paper we show that minimum-cost spanning tree is a special case of the closed semiring path-finding problem. This observation gives us a non-recursive algorithm for finding minimumcost spanning trees on mesh-connected computers that has the same asymptotic running time but is much simpler
Results 1 - 10
of
1,081
