628 search results - page 97 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
122
click to vote
CIC
2004
15 years 4 months ago
2004
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
118
click to vote
MP
2011
14 years 10 months ago
2011
We consider a quadratic programming (QP) problem (Π) of the form min xT Cx subject to Ax ≥ b where C ∈ Rn×n + , rank(C) = 1 and A ∈ Rm×n , b ∈ Rm . We present an FPTAS ...
139
click to vote
P2P
2006
IEEE
15 years 9 months ago
2006
IEEE
The main purpose of many current peer-to-peer (P2P) networks is off-line file sharing. However, a potentially very promising use of such networks is to share video streams (e.g.,...
135
click to vote
SIAMCOMP
2010
15 years 1 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
117
click to vote
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...