Search Results

There are 38966 results for: content related to: Optimum steiner ratio for gradient-constrained networks connecting three points in 3-space, part II: The gradient-constraint m satisfies \documentclass{article} \usepackage{amsmath,amsfonts,amssymb}\pagestyle{empty}\begin{document}$ 1 \leq m \leq \sqrt{3} $\end{document}

  1. Finding integer efficient solutions for multiple objective network programming problems

    Networks

    Volume 57, Issue 4, July 2011, Pages: 362–375, Minghe Sun

    Article first published online : 1 OCT 2010, DOI: 10.1002/net.20407

  2. Nonblocking multirate log2(N,m,p) switching networks with multicast connections

    Networks

    Volume 57, Issue 4, July 2011, Pages: 333–343, Wojciech Kabaciński and Tomasz Wichary

    Article first published online : 22 DEC 2010, DOI: 10.1002/net.20403

  3. On large (Δ, D, D, 1)-graphs

    Networks

    Volume 57, Issue 4, July 2011, Pages: 316–327, J. Gómez, J. Fàbrega and J.L.A. Yebra

    Article first published online : 18 AUG 2010, DOI: 10.1002/net.20401

  4. Optimal online ring routing

    Networks

    Volume 57, Issue 2, March 2011, Pages: 187–197, Jessen T. Havill and Kevin R. Hutson

    Article first published online : 30 JUL 2010, DOI: 10.1002/net.20400

  5. Least central subtrees, center, and centroid of a tree

    Networks

    Volume 57, Issue 4, July 2011, Pages: 328–332, Martti Hamina and Matti Peltola

    Article first published online : 18 AUG 2010, DOI: 10.1002/net.20402

  6. Approximation of a batch consolidation problem

    Networks

    Volume 58, Issue 1, August 2011, Pages: 12–19, Junho Chang, Soo Y. Chang, Sung-Pil Hong, Yun-Hong Min and Myoung-Ju Park

    Article first published online : 1 OCT 2010, DOI: 10.1002/net.20409

  7. Graph labelings derived from models in distributed computing: A complete complexity classification

    Networks

    Volume 58, Issue 3, October 2011, Pages: 207–231, Jérémie Chalopin and Daniël Paulusma

    Article first published online : 10 MAR 2011, DOI: 10.1002/net.20432

  8. High-confidence estimation of small s-t reliabilities in directed acyclic networks

    Networks

    Volume 57, Issue 4, July 2011, Pages: 376–388, Rico Zenklusen and Marco Laumanns

    Article first published online : 1 OCT 2010, DOI: 10.1002/net.20412

  9. Deception tactics for network interdiction: A multiobjective approach

    Networks

    Volume 60, Issue 1, August 2012, Pages: 45–58, Javier Salmerón

    Article first published online : 19 SEP 2011, DOI: 10.1002/net.20458

  10. Edge-superconnectivity of semiregular cages with odd girth

    Networks

    Volume 58, Issue 3, October 2011, Pages: 201–206, C. Balbuena, D. González-moreno and J. Salas

    Article first published online : 10 MAR 2011, DOI: 10.1002/net.20431

  11. Locating median paths on connected outerplanar graphs

    Networks

    Volume 57, Issue 3, May 2011, Pages: 294–307, Isabella Lari, Federica Ricca, Andrea Scozzari and Ronald I. Becker

    Article first published online : 25 MAR 2011, DOI: 10.1002/net.20426

  12. A note on Steiner tree games

    Networks

    Volume 59, Issue 2, March 2012, Pages: 215–225, Darko Skorin-Kapov and Jadranka Skorin-Kapov

    Article first published online : 17 MAR 2011, DOI: 10.1002/net.20436

  13. 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

    Article first published online : 25 NOV 2011, DOI: 10.1002/net.20479

  14. Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment

    Networks

    Volume 59, Issue 2, March 2012, Pages: 191–208, Paolo Serafini and Bruno Simeone

    Article first published online : 25 MAR 2011, DOI: 10.1002/net.20434

  15. Online traveling salesman problems with service flexibility

    Networks

    Volume 58, Issue 2, September 2011, Pages: 137–146, Patrick Jaillet and Xin Lu

    Article first published online : 2 AUG 2011, DOI: 10.1002/net.20454

  16. Network flow methods for electoral systems

    Networks

    Volume 59, Issue 1, January 2012, Pages: 73–88, Friedrich Pukelsheim, Federica Ricca, Bruno Simeone, Andrea Scozzari and Paolo Serafini

    Article first published online : 25 NOV 2011, DOI: 10.1002/net.20480

  17. Compression and expansion in graphs using overlays

    Networks

    Volume 58, Issue 1, August 2011, Pages: 36–42, Bilal Khan and Kiran R. Bhutani

    Article first published online : 22 DEC 2010, DOI: 10.1002/net.20411

  18. The preemptive swapping problem on a tree

    Networks

    Volume 58, Issue 2, September 2011, Pages: 83–94, Shoshana Anily, Michel Gendreau and Gilbert Laporte

    Article first published online : 2 AUG 2011, DOI: 10.1002/net.20451

  19. Computing approximate Nash equilibria in network congestion games

    Networks

    Volume 59, Issue 4, July 2012, Pages: 380–386, Andreas Emil Feldmann, Heiko Röglin and Berthold Vöcking

    Article first published online : 1 AUG 2011, DOI: 10.1002/net.20444

  20. Complexity of column generation in network design with path-based survivability mechanisms

    Networks

    Volume 59, Issue 1, January 2012, Pages: 132–147, Sebastian Orlowski and Michał Pióro

    Article first published online : 29 NOV 2011, DOI: 10.1002/net.20484