Search Results

There are 6099 results for: content related to: Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty

  1. Graph bootstrap percolation

    Random Structures & Algorithms

    Volume 41, Issue 4, December 2012, Pages: 413–440, József Balogh, Béla Bollobás and Robert Morris

    Version of Record online : 4 SEP 2012, DOI: 10.1002/rsa.20458

  2. Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges

    Random Structures & Algorithms

    Volume 40, Issue 3, May 2012, Pages: 350–384, Ilan Gronau, Shlomo Moran and Sagi Snir

    Version of Record online : 31 MAY 2011, DOI: 10.1002/rsa.20372

  3. Large deviation analysis for layered percolation problems on the complete graph

    Random Structures & Algorithms

    Volume 40, Issue 4, July 2012, Pages: 460–492, Lincoln Chayes and S. Alex Smith

    Version of Record online : 23 NOV 2011, DOI: 10.1002/rsa.20387

  4. Asymptotic enumeration of strongly connected digraphs by vertices and edges

    Random Structures & Algorithms

    Volume 43, Issue 1, August 2013, Pages: 80–114, Xavier Pérez-Giménez and Nicholas Wormald

    Version of Record online : 26 APR 2012, DOI: 10.1002/rsa.20416

  5. Convergence analysis of some high–order time accurate schemes for a finite volume method for second order hyperbolic equations on general nonconforming multidimensional spatial meshes

    Numerical Methods for Partial Differential Equations

    Volume 29, Issue 4, July 2013, Pages: 1278–1321, Abdallah Bradji

    Version of Record online : 5 DEC 2012, DOI: 10.1002/num.21755

  6. Packing tight Hamilton cycles in 3-uniform hypergraphs

    Random Structures & Algorithms

    Volume 40, Issue 3, May 2012, Pages: 269–300, Alan Frieze, Michael Krivelevich and Po-Shen Loh

    Version of Record online : 28 JUN 2011, DOI: 10.1002/rsa.20374

  7. Turánnical hypergraphs

    Random Structures & Algorithms

    Volume 42, Issue 1, January 2013, Pages: 29–58, Peter Allen, Julia Böttcher, Jan Hladký and Diana Piguet

    Version of Record online : 18 FEB 2012, DOI: 10.1002/rsa.20399

  8. Extremal subgraphs of random graphs

    Random Structures & Algorithms

    Volume 41, Issue 2, September 2012, Pages: 147–178, Graham Brightwell, Konstantinos Panagiotou and Angelika Steger

    Version of Record online : 19 MAR 2012, DOI: 10.1002/rsa.20413

  9. Sharp kernel clustering algorithms and their associated Grothendieck inequalities

    Random Structures & Algorithms

    Volume 42, Issue 3, May 2013, Pages: 269–300, Subhash Khot and Assaf Naor

    Version of Record online : 29 FEB 2012, DOI: 10.1002/rsa.20398

  10. A theoretical analysis of a new finite volume scheme for second order hyperbolic equations on general nonconforming multidimensional spatial meshes

    Numerical Methods for Partial Differential Equations

    Volume 29, Issue 1, January 2013, Pages: 1–39, Abdallah Bradji

    Version of Record online : 9 FEB 2012, DOI: 10.1002/num.21697

  11. Survivability in hierarchical telecommunications networks

    Networks

    Volume 59, Issue 1, January 2012, Pages: 37–58, Pierre Fouilhoux, Oya Ekin Karasan, A. Ridha Mahjoub, Onur Özkök and Hande Yaman

    Version of Record online : 25 NOV 2011, DOI: 10.1002/net.20479

  12. Formulations for dynamic lot sizing with service levels

    Naval Research Logistics (NRL)

    Volume 60, Issue 2, March 2013, Pages: 87–101, Dinakar Gade and Simge Küçükyavuz

    Version of Record online : 9 JAN 2013, DOI: 10.1002/nav.21519

  13. Robust characterizations of k-wise independence over product spaces and related testing results

    Random Structures & Algorithms

    Volume 43, Issue 3, October 2013, Pages: 265–312, Ronitt Rubinfeld and Ning Xie

    Version of Record online : 7 MAY 2012, DOI: 10.1002/rsa.20423

  14. Time evolution of dense multigraph limits under edge-conservative preferential attachment dynamics

    Random Structures & Algorithms

    Volume 41, Issue 3, October 2012, Pages: 365–390, Balázs Ráth

    Version of Record online : 26 APR 2012, DOI: 10.1002/rsa.20422

  15. Affine recourse for the robust network design problem: Between static and dynamic routing

    Networks

    Volume 61, Issue 2, March 2013, Pages: 180–198, Michael Poss and Christian Raack

    Version of Record online : 7 SEP 2012, DOI: 10.1002/net.21482

  16. Study of simulation method of time evolution in rigged QED

    International Journal of Quantum Chemistry

    Volume 113, Issue 3, 5 February 2013, Pages: 190–202, Kazuhide Ichikawa, Masahiro Fukuda and Akitomo Tachibana

    Version of Record online : 7 APR 2012, DOI: 10.1002/qua.24087

  17. Complexity of a classical flow restoration problem

    Networks

    Volume 62, Issue 2, September 2013, Pages: 149–160, Dritan Nace, Michał Pióro, Artur Tomaszewski and Mateusz Żotkiewicz

    Version of Record online : 28 MAY 2013, DOI: 10.1002/net.21508

  18. Anatomy of a young giant component in the random graph

    Random Structures & Algorithms

    Volume 39, Issue 2, September 2011, Pages: 139–178, Jian Ding, Jeong Han Kim, Eyal Lubetzky and Yuval Peres

    Version of Record online : 15 SEP 2010, DOI: 10.1002/rsa.20342

  19. The number of graphs and a random graph with a given degree sequence

    Random Structures & Algorithms

    Volume 42, Issue 3, May 2013, Pages: 301–348, Alexander Barvinok and J.A. Hartigan

    Version of Record online : 29 FEB 2012, DOI: 10.1002/rsa.20409

  20. Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1.

    Random Structures & Algorithms

    Volume 43, Issue 4, December 2013, Pages: 486–539, Tatyana S. Turova

    Version of Record online : 16 JUL 2013, DOI: 10.1002/rsa.20503