Found 92 Documents (Results 1–92)
Almost tight approximation hardness for single-source directed \(k\)-edge-connectivity. (English) Zbl 07870299
Bojańczyk, Mikołaj (ed.) et al., 49th EATCS international conference on automata, languages, and programming, ICALP 2022, Paris, France, July 4–8, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 229, Article 89, 17 p. (2022).
The edge-labeled survivable network design problem: formulations and branch-and-cut. (English) Zbl 1507.90107
Fast exact algorithms for survivable network design with uniform requirements. (English) Zbl 1540.68159
Designing survivable networks with zero-suppressed binary decision diagrams. (English) Zbl 07224290
Rahman, M. Sohel (ed.) et al., WALCOM: algorithms and computation. 14th international conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12049, 273-285 (2020).
MSC:
68Wxx
Survivable network design for group connectivity in low-treewidth graphs. (English) Zbl 1521.68092
Blais, Eric (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 21st international workshop, APPROX 2018, and 22nd international workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 116, Article 8, 19 p. (2018).
Greedy algorithms for online survivable network design. (English) Zbl 1499.68410
Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 152, 14 p. (2018).
A note on iterated rounding for the survivable network design problem. (English) Zbl 1433.68285
Seidel, Raimund (ed.), 1st symposium on simplicity in algorithms. SOSA 2018, January 7–10, 2018, New Orleans, LA, USA. Co-located with the 29th ACM-SIAM symposium on discrete algorithms (SODA 2018). Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. OASIcs – OpenAccess Ser. Inform. 61, Article 2, 10 p. (2018).
Branch-and-cut methods for the network design problem with vulnerability constraints. (English) Zbl 1391.90147
Formulations for designing robust networks. An application to wind power collection. (English) Zbl 1392.90021
Gouveia, Luís (ed.) et al., Proceedings of the 8th international network optimization conference (INOC 2017), Lisbon, Portugal, February 26–28, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 64, 365-374 (2018).
Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree. (English) Zbl 1370.68231
Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 420-428 (2017).
The two-edge connectivity survivable-network design problem in planar graphs. (English) Zbl 1445.68152
Integer programming formulations for the \(k\)-edge-connected 3-hop-constrained network design problem. (English) Zbl 1390.90104
Fast approximation algorithms for the generalized survivable network design problem. (English) Zbl 1398.68673
Seok-Hee Hong (ed.), 27th international symposium on algorithms and computation, ISAAC 2016, Sydney, Australia, December 12–14, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-026-2). LIPIcs – Leibniz International Proceedings in Informatics 64, Article 33, 12 p. (2016).
The minimum spanning \(k\)-core problem with bounded CVaR under probabilistic edge failures. (English) Zbl 1343.90102
MSC:
90C35
Optimizing flow thinning protection in multicommodity networks with variable link capacity. (English) Zbl 1342.90036
Approximating the generalized terminal backup problem via half-integral multiflow relaxation. (English) Zbl 1345.90074
Approximating the generalized terminal backup problem via half-integral multiflow relaxation. (English) Zbl 1356.90123
Mayr, Ernst W. (ed.) et al., 32nd international symposium on theoretical aspects of computer science, STACS’15, Garching, Germany, March 4–7, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-78-1). LIPIcs – Leibniz International Proceedings in Informatics 30, 316-328 (2015).
More facets for survivable networks. (English) Zbl 1390.90115
MSC:
90B10
An \(O(k^3\log n)\)-approximation algorithm for vertex-connectivity survivable network design. (English) Zbl 1253.68167
Complexity of column generation in network design with path-based survivability mechanisms. (English) Zbl 1241.90091
MSC:
90C11
Approximation algorithm for optimal location of concentrators and design of capacitated survivable backbone networks. (English) Zbl 1204.90016
Strong lower bounds for a survivable network design problem. (English) Zbl 1237.90173
Haouari, M. (ed.) et al., ISCO 2010. International symposium on combinatorial optimization. Papers based on the presentations at the symposium, Hammamet, Tunesia, March 24–26, 2010. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 36, 295-302 (2010).
Two-level evolutionary approach to the survivable mesh-based transport network topological design. (English) Zbl 1196.90026
Simpler analysis of LP extreme points for traveling salesman and survivable network design problems. (English) Zbl 1187.90235
Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs. (English) Zbl 1236.68010
Albers, Susanne (ed.) et al., STACS 2009. 26th international symposium on theoretical aspects of computer science, Freiburg, Germany, February 26–28, 2009. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-09-5). LIPIcs – Leibniz International Proceedings in Informatics 3, 171-182, electronic only (2009).
Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles. (English) Zbl 1168.90356
Survivable network design with degree or order constraints. (English) Zbl 1232.68182
STOC’07. Proceedings of the 39th annual ACM symposium on theory of computing, San Diego, CA, USA, June 11–13, 2007. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-59593-631-8). 651-660 (2007).
Integer programming formulations for the two 4-hop-constrained paths problem. (English) Zbl 1180.90200
Branch-and-cut algorithm for optimization of non-bifurcated multicommodity flows in survivable networks. (English) Zbl 1179.90329
Design of survivable networks based on \(p\)-cycles. (English) Zbl 1118.90013
Resende, Mauricio G. C. (ed.) et al., Handbook of optimization in telecommunications. New York, NY: Springer (ISBN 0-387-30662-5/hbk). 391-434 (2006).
Telecommunications access network design. (English) Zbl 1118.90027
Resende, Mauricio G. C. (ed.) et al., Handbook of optimization in telecommunications. New York, NY: Springer (ISBN 0-387-30662-5/hbk). 313-339 (2006).
Minimum \(k\)-geodetically connected digraphs. (English) Zbl 1055.05072
Reviewer: Gregory Gutin (Egham, Surrey)
A directed cycle-based column-and-cut generation method for capacitated survivable network design. (English) Zbl 1053.90016
MSC:
90B10
A branch and bound algorithm for primary routes assignment in survivable connection oriented networks. (English) Zbl 1044.90093
An efficient technique for dynamic lightpath establishment in survivable local/metro WDM optical networks. (English) Zbl 1205.68048
Das, Samir R. (ed.) et al., Distributed computing – IWDC 2003. 5th international workshop, Kolkata, India, December 27–30, 2003. Proceedings. Berlin: Springer (ISBN 3-540-20745-7/pbk). Lect. Notes Comput. Sci. 2918, 350-360 (2003).
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs. (English) Zbl 1012.68227
Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems. (English) Zbl 1093.68672
Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, USA, January 6–8, 2002. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-513-X/pbk). 1000-1001 (2002).
Capacity efficiency of distributed path restoration mechanisms in optical mesh networks. (English) Zbl 1046.68888
Gregori, Enrico (ed.) et al., NETWORKING 2002. Networking technologies, services, and protocols; performance of computer and communication networks; mobile and wireless communications. 2nd international IFIP-TC6 networking conference, Pisa, Italy, May 19–24, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43709-6). Lect. Notes Comput. Sci. 2345, 875-886 (2002).
Separation of partition inequalities for the \((1,2)\)-survivable network design problem. (English) Zbl 1049.90010
Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems. (English) Zbl 1017.68157
The branch and bound algorithm for a backup virtual path assignment in survivable ATM networks. (English) Zbl 1038.90503
Survivable security components for high speed networks. Design and realization taking a packet screen as example. (Überlebensfähige Sicherheitskomponenten für Hochgeschwindigkeitsnetze. Entwurf und Realisierung am Beispiel einer Packet Screen.) (German) Zbl 0995.68003
Aachen: Shaker Verlag. Hamburg: Univ. Hamburg, Fachbereich Informatik, xiv, 345 S. (2002).
A primal-dual approximation algorithm for the survivable network design problem in hypergraph. (English) Zbl 0978.68015
Ferreira, Afonso (ed.) et al., STACS 2001. 18th annual symposium on theoretical aspects of computer science. Dresden, Germany, February 15-17, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2010, 478-489 (2001).
Survivable capacitated network design problem: new formulation and Lagrangean relaxation. (English) Zbl 1055.90539
Design of broadband virtual private networks: Model and heuristics for the B-WiN. (English) Zbl 0965.90004
Dean, Nathaniel (ed.) et al., Robust communication networks: Interconnection and survivability. DIMACS workshop, Princeton, NJ, USA, November 18-20, 1998. Providence, RI: AMS, American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 53, 1-16 (2000).
A branch-and-cut algorithm for solving and intraring synchronous optical network design problem. (English) Zbl 0985.90093
The forcer concept and express route planning in mesh-survivable networks. (English) Zbl 1147.68352
J. Netw. Syst. Manag. 7, No. 2, 199-223 (1999).
MSC:
68M10
Resource management for fault tolerant path structures in SONET ring networks. (English) Zbl 1147.68353
J. Netw. Syst. Manag. 7, No. 4, 373-394 (1999).
MSC:
68M10
An efficient approximation algorithm for the survivable network design problem. (English) Zbl 0922.90140
Solving the survivable network design problem with search space smoothing. (English) Zbl 0878.90038
Pardalos, Panos M. (ed.) et al., Network optimization. Conference, Center for Applied Optimization, Univ. of Florida, Gainesville, FL, USA, February 12-14, 1996. Berlin: Springer. Lect. Notes Econ. Math. Syst. 450, 397-406 (1997).
A primal-dual approximation algorithm for generalized Steiner network problems. (English) Zbl 0838.90133
Design of survivable networks. (English) Zbl 0839.90132
Ball, M. O. (ed.) et al., Network models. Amsterdam: North-Holland. Handb. Oper. Res. Manage. Sci. 7, 617-672 (1995).
Models and methods for the construction of survivable networks. (Modelle und Methoden zur Konstruktion ausfallsicherer Netzwerke.) (German) Zbl 0884.90083
Bachem, Achim (ed.) et al., Mathematik in der Praxis. Fallstudien aus Industrie, Wirtschaft, Naturwissenschaften und Medizin. Ausarbeitungen der Vorträge der Tagung “Mathematik in Industrie und Wirtschaft”, März 1993, Köln/Germany. Berlin: Springer-Verlag. 533-549 (1995).
Survivable networks, linear programming relaxations and the parsimonious property. (English) Zbl 0790.90072
An efficient approximation algorithm for the survivable network design problem. (English) Zbl 0923.90136
Rinaldi, Giovanni (ed.) et al., Integer programming and combinatorial optimization. Proceedings of a conference held at Centro Ettore Majorana, Erice, Italy, April 29 - May 1, 1993. Louvain-la-Neuve: Librarian CORE, 57-74 (1993).
Filter Results by …
Document Type
- Journal Articles (68)
- Collection Articles (23)
- Books (1)
all
top 5
Author
- Mahjoub, Ali Ridha (10)
- Williamson, David P. (6)
- Ravi, Ramamoorthi (5)
- Goemans, Michel Xavier (4)
- Kerivin, Hervé L. M. (4)
- Singh, Mohit (4)
- Diarrassouba, Ibrahima (3)
- Gouveia, Luis (3)
- Grötschel, Martin (3)
- Grover, Wayne D. (3)
- Huygens, David (3)
- Laekhanukit, Bundit (3)
- Lau, Lap Chi (3)
- Leitner, Markus (3)
- Pesneau, Pierre (3)
- Pióro, Michał (3)
- Walkowiak, Krzysztof M. (3)
- Atamtürk, Alper (2)
- Balasundaram, Balabhaskar (2)
- Bertsimas, Dimitris John (2)
- Borradaile, Glencora (2)
- Fukunaga, Takuro (2)
- Gabow, Harold N. (2)
- Ibaraki, Toshihide (2)
- Kortsarz, Guy (2)
- Levin, Asaf (2)
- Ma, Juan (2)
- Nace, Dritan (2)
- Nagamochi, Hiroshi (2)
- Naor, Joseph Seffi (2)
- Nutov, Zeev (2)
- Plesník, Ján (2)
- Rajan, Deepak (2)
- Salavatipour, Mohammad R. (2)
- Stoer, Mechthild (2)
- Wessäly, Roland (2)
- Zhao, Liang (2)
- Agarwal, Yogesh Kumar (1)
- Agrawal, Akanksha (1)
- Alevras, Dimitris (1)
- Almathkour, Fatmah (1)
- Aneja, Yash P. (1)
- Anshelevich, Elliot (1)
- Balakrishnan, Anantaram (1)
- Bandyopadhyay, Subir (1)
- Bendali, Fatiha (1)
- Benecke, Carsten (1)
- Bentz, Cédric (1)
- Bera, Sougata (1)
- Bernáth, Attila (1)
- Biha, Mohamed Didi (1)
- Bley, Andreas (1)
- Boginski, Vladimir L. (1)
- Carpenter, Tamra J. (1)
- Carroll, Paula (1)
- Caskurlu, Bugra (1)
- Chalermsook, Parinya (1)
- Chekuri, Chandra S. (1)
- Chen, Qingyun (1)
- Chen, Songqing (1)
- Chuzhoy, Julia (1)
- Clouqueur, Matthieu (1)
- Costa, Marie-Christine (1)
- Crainic, Teodor Gabriel (1)
- Dahl, Geir (1)
- Das, Syamantak (1)
- Dehghani, Sina (1)
- Demaine, Erik D. (1)
- Doucette, John (1)
- Ehsani, Soheil (1)
- Even, Guy (1)
- Feldmann, Andreas Emil (1)
- Fortz, Bernard (1)
- Fouquet, Yoann (1)
- Gabrel, Virginie (1)
- Goldschmidt, Olivier (1)
- Grandoni, Fabrizio (1)
- Gupta, Anupam (1)
- Hajiaghayi, Mohammad Taghi (1)
- Han, Chi-Geun (1)
- Han, Junghee (1)
- Hassin, Refael (1)
- Hill, Alessandro (1)
- Hochbaum, Dorit S. (1)
- Hui, Kin-Ping (1)
- Ishihata, Masakazu (1)
- Jaekel, Arunita (1)
- Jotshi, Arun (1)
- Joyce-Moniz, Martim (1)
- Kaut, Michal (1)
- Khanna, Sanjeev (1)
- Kianfar, Kiavash (1)
- Kim, Hyunjoon (1)
- Kim, Seongin (1)
- Klein, Philip N. (1)
- Kobayashi, Yusuke (1)
- Kodian, Adil (1)
- Könemann, Jochen (1)
- Krauthgamer, Robert (1)
- Krishnaswamy, Ravishankar (1)
- and 73 more Authors
all
top 5
Serial
- Networks (15)
- Oper. Res. Lett. (5)
- SIAM J. Comput. (4)
- SIAM J. Discrete Math. (4)
- Algorithmica (3)
- Eur. J. Oper. Res. (3)
- Discrete Appl. Math. (2)
- Oper. Res. (2)
- Theor. Comput. Sci. (2)
- Ann. Oper. Res. (2)
- Math. Program. (2)
- Discrete Optim. (2)
- Discrete Math. (1)
- IEEE Trans. Circuits Syst. (1)
- J. Oper. Res. Soc. (1)
- Manage. Sci. (1)
- Math. Oper. Res. (1)
- Combinatorica (1)
- Comput. Oper. Res. (1)
- J. Glob. Optim. (1)
- Syst. Sci. (1)
- Comput. Optim. Appl. (1)
- J. Heuristics (1)
- INFORMS J. Comput. (1)
- Theory Comput. Syst. (1)
- Int. J. Appl. Math. Comput. Sci. (1)
- RAIRO, Oper. Res. (1)
- Comput. Netw. (1)
- Int. J. Math. Oper. Res. (1)
- ACM Trans. Algorithms (1)
- Theory Comput. (1)
- EURO J. Comput. Optim. (1)
