[PDF] Top 20 A note on a 2-approximation algorithm for the mrct problem
Has 10000 "A note on a 2-approximation algorithm for the mrct problem" found on our website. Below are the top 20 most common "A note on a 2-approximation algorithm for the mrct problem".
A note on a 2-approximation algorithm for the mrct problem
... Consider the following problem in network design: given an undirected graph with nonnegative delays on the edges, the goal is to find a spanning tree such that the average ... See full document
7
a note on 15/8 & 3/2-approximation algorithms for the MRCT problem
... 1.2 A 15/8-approximation algorithm In our previous note, a 1/2-separator is used to derive a 2-approximation ...algorithm. The idea is ... See full document
10
A note on a polynomial time approximation scheme for the mrct problem
... breakthrough, the restriction that each vertex is connected to the closest vertex of the core needs to be ...relaxed. A metric graph is a complete graph with triangle inequality, ...is ... See full document
10
A 2-approximation algorithm for the SROCT problem
... Find a spanning tree T of minimum ...that the s.r.c. routing cost of a tree T is defined by C s (T ) = P u,v (r(u) + r(v))d T (u, ...to the PROCT problem, the SROCT ... See full document
4
A dynamic programming algorithm based on expected revenue approximation for the network revenue management problem
... change the demand arrival pattern, the request probabilities of the three high-fare ODFs were adjusted by the low-be- fore-high factor (m) according to the linearly relation in ...(10). ... See full document
9
An approximation algorithm for a competitive facility location problem with network effects
... provide a good illustration. As one of the most famous United States car sharing system nowadays, Zipcar is well known due to its new technologies and flexible renting ...as a member of Zipcar only ... See full document
32
An approximation algorithm for energy-efficient scheduling on a chip multiprocessor
... scheduling on a chip multiprocessor with dynamic voltage ...share a common deadline. When a task partition is given, we present an optimal scheduling algorithm for the ... See full document
6
A Note on the Discontinuity Problem in Heston's Stochastic Volatility
... of the usefulness of this approach for evaluating European call options in Heston’s model on stochastic volatility with the complex logarithm using the principal branch ...only. ... See full document
8
A Sub-Quadratic Algorithm on the Crossing Distribution Problem
... given a sequence of numbers, we know that number i at position s i and number j at position s j have an inversion if j < i and s j is larger than s i .... For each integer i in (1, 2, …, n), ... See full document
16
A NETWORK SIMPLEX ALGORITHM FOR SOLVING THE MINIMUM DISTRIBUTION COST PROBLEM
... that the augmented basic graph G 0 B (x) contains n + q − p − 1 basic arcs and n + q ...nodes. The search algorithm scans each arc and node exactly once in Step 3 and results in a total θ(n + ... See full document
22
A DIRECT RECONSTRUCTION ALGORITHM FOR THE ANISOTROPIC INVERSE CONDUCTIVITY PROBLEM BASED ON CALDER ´ON’S METHOD IN THE PLANE
... conductivity problem is the mathematical model behind a medical imaging technology known as electrical impedance tomography ...has the attributes of being inexpensive, non-invasive, ... See full document
18
A Distributed Approximation for Multi-Hop Clustering Problem in Wireless Sensor Networks
... d 2 - Cluster is an effective clustering algorithm for WSNs ...studied the multi-hop clustering problem for a given wireless sensor network, which is defined as d- MCHS ... See full document
6
Mesh Optimization for Surface Approximation Using An Efficient Genetic Algorithm With A Novel 2-D Orthogonal Crossover
... proposed for establishing optimal mesh surfaces. It was shown that the GA-based method is effective in searching the combinatorial space which is intractable when n and N are in order of ...genetic ... See full document
8
A self-stabilizing algorithm for the bridge-finding problem assuming the distributed demon model
... that the results in this paper as well as the re- sults in [2], [3] and [5] all have the same weakness - each of them depends on an assumption of the pres- ence of some rooted ... See full document
8
A NOTE ON THE ASCENDING SUBGRAPH DECOMPOSITION PROBLEM
... A graph G that can be decomposed as described in the conjecture will be said to have an ascending subgraph decomposition (abbreviated ASD).. (North-Holland)..[r] ... See full document
4
A note on coupon collecting problem
... In the classical coupon collecting problem (CCP), the collector collects one coupon at a time sequentially until a “complete set” consisting of one of each type is ...of the main ... See full document
10
A genetic algorithm approach for the object-sorting task problem
... Most multi-agent tasks have high complexity. Optimal solu- tions of them are nearly intractable because of the large com- plexity. One approach is to use stochastic search techniqu[r] ... See full document
6
A multiobjective hybrid genetic algorithm for the capacitated multipoint network design problem
... Genetic Algorithm for the Capacitated Multipoint Network Design Problem Chi-Chun Lo, Member, IEEE, and Wei-Hsin Chang, Member, IEEE Abstract—The capacitated multipoint network design ... See full document
10
A note on the decomposition methods for support vector regression
... Technical report, Department of Computer Science and Information Engineering, National Taiwan University, 2000. On the convergence of the decomposi- tion method for support vec[r] ... See full document
6
A Self-stabilizing Algorithm for the Center-finding Problem Under a More Realistic Demon
... ABSTRACT The problem of locating centers in distributed systems are especially important since they are ideal locations for placing resources that need to be shared among different processors in ... See full document
15
相關主題