Results 1  10
of
54
All Pairs Lightest Shortest Paths
 In Proceedings of the 31th Annual ACM Symposium on Theory of Computing
, 1999
"... Two vertices in a weighted directed graph may be connected by many shortest paths. Although all these paths are shortest in terms of weight, the number of edges on them may vary substantially. This leads us to consider the All Pairs Lightest Shortest Paths (APLSP) problem. A solution to this problem ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
Two vertices in a weighted directed graph may be connected by many shortest paths. Although all these paths are shortest in terms of weight, the number of edges on them may vary substantially. This leads us to consider the All Pairs Lightest Shortest Paths (APLSP) problem. A solution
More algorithms for allpairs shortest paths in weighted graphs
 In Proceedings of 39th Annual ACM Symposium on Theory of Computing
, 2007
"... In the first part of the paper, we reexamine the allpairs shortest paths (APSP) problem and present a new algorithm with running time O(n 3 log 3 log n / log 2 n), which improves all known algorithms for general realweighted dense graphs. In the second part of the paper, we use fast matrix multipl ..."
Abstract

Cited by 75 (3 self)
 Add to MetaCart
as an improved result (near O(n (3+ω)/2) = O(n 2.688) time) for the allpairs lightest shortest path problem for smallintegerweighted graphs. 1
Efficient Algorithms for Computing All Low st Edge Connectivities and Related
 Problems, Proc. of the 18th Annual ACMSIAM Symposium on Discrete Algorithms
, 2007
"... Given an undirected unweighted graph G =(V,E) andan integer k ≥ 1, we consider the problem of computing the edge connectivities of all those (s, t) vertex pairs, whose edge connectivity is at most k. We present an algorithm with expected running time Õ(m + nk3) for this problem, where V  = n and ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
vertices s and t belong to the same Vi for any i if and only if they have an edge connectivity greater than k. Currently, the best algorithm for this problem needs to compute allpairs mincuts in an O(nk) edge graph; this
SEARCH FOR SUPERSYMMETRIC W ∼ 1 AND Z ∼ 2 STATES USING THE DØ DETECTOR
, 1994
"... The status of a search for the pair production of the lightest chargino and second lightest neutralino states of the minimal supersymmetric model is presented. We have searched for four trilepton final states: eee, eeµ, eµµ, and µµµ, all with missing transverse energy. 1. ..."
Abstract
 Add to MetaCart
The status of a search for the pair production of the lightest chargino and second lightest neutralino states of the minimal supersymmetric model is presented. We have searched for four trilepton final states: eee, eeµ, eµµ, and µµµ, all with missing transverse energy. 1.
Numerical evidence for the observation of a scalar glueball
, 1995
"... We compute from lattice QCD in the valence (quenched) approximation the partial decay widths of the lightest scalar glueball to pairs of pseudoscalar quarkantiquark states. These predictions and values obtained earlier for the scalar glueball’s mass are in good agreement with the observed propertie ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We compute from lattice QCD in the valence (quenched) approximation the partial decay widths of the lightest scalar glueball to pairs of pseudoscalar quarkantiquark states. These predictions and values obtained earlier for the scalar glueball’s mass are in good agreement with the observed
1 Continuum Limit of Scalar Masses and Mixing Energies
, 1998
"... We evaluate the continuum limit of the valence approximation to the mass of scalar quarkonium and to the scalar quarkoniumglueball mixing energy for a range of different quark masses. Our results answer several questions raised by the proposed identification of f0(1710) as composed primarily of the ..."
Abstract
 Add to MetaCart
of the lightest scalar glueball. Evidence that f0(1710) is composed mainly of the lightest scalar glueball is now given by a calculation [1], on a 163 × 24 lattice at β of 5.70, yielding 108(29) MeV as the width for the lightest scalar glueball to decay to all possible pseudoscalar pairs, and by three independent
HUNTING VIRTUAL LSPs AT LEP 200
, 1995
"... Relatively light sneutrinos, which are experimentally allowed, may significantly affect the currently popular search strategies for supersymmetric particles by decaying dominantly into an invisible channel. In certain cases the second lightest neutralino may also decay invisibly leading to two extra ..."
Abstract
 Add to MetaCart
and are consistent with all constraints derived so far from SUSY searches. The pair production of right handed sleptons, which can very well be the lightest charged SUSY particles in this scenario, at LEP 200 and their decay signatures are discussed. The signal survives kinematical cuts required to remove
micrOMEGAs: Version 1.3
 Comput. Phys. Commun
"... Abstract We present the latest version of micrOMEGAs, a code that calculates the relic density of the lightest supersymmetric particle (LSP) in the minimal supersymmetric standard model (MSSM). All treelevel processes for the annihilation of the LSP are included as well as all possible coannihilat ..."
Abstract

Cited by 26 (2 self)
 Add to MetaCart
Abstract We present the latest version of micrOMEGAs, a code that calculates the relic density of the lightest supersymmetric particle (LSP) in the minimal supersymmetric standard model (MSSM). All treelevel processes for the annihilation of the LSP are included as well as all possible
Exact Cross Sections for the Neutralino WIMP PairAnnihilation
, 2002
"... Abstract: We derive a full set of exact, analytic expressions for the annihilation of the lightest neutralino pairs into all twobody treelevel final states in the framework of minimal supersymmetry. We make no simplifying assumptions about the neutralino nor about sfermion masses and mixings other ..."
Abstract
 Add to MetaCart
Abstract: We derive a full set of exact, analytic expressions for the annihilation of the lightest neutralino pairs into all twobody treelevel final states in the framework of minimal supersymmetry. We make no simplifying assumptions about the neutralino nor about sfermion masses and mixings
EUROPEAN ORGANISATION FOR NUCLEAR RESEARCH (CERN) CERNPHEP2014143
"... Search for top squark pair production in final states with one isolated lepton, jets, and missing transverse momentum in√ s = 8TeV pp collisions with the ATLAS detector The ATLAS Collaboration The results of a search for top squark (stop) pair production in final states with one isolated lepton, jet ..."
Abstract
 Add to MetaCart
Search for top squark pair production in final states with one isolated lepton, jets, and missing transverse momentum in√ s = 8TeV pp collisions with the ATLAS detector The ATLAS Collaboration The results of a search for top squark (stop) pair production in final states with one isolated lepton
Results 1  10
of
54