✦ LIBER ✦

Polyhedral study of the connected subgraph problem

✍ Scribed by Didi Biha, Mohamed; Kerivin, Hervé L.M.; Ng, Peh H.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polyhedral study of the maximum common i

✍ Breno Piva, Cid Carvalho de Souza 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 947 KB

A polyhedral study of the maximum edge s

✍ Flavia Bonomo; Javier Marenco; Daniela Saban; Nicolás E. Stier-Moses 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 317 KB

The maximum common edge subgraph problem

✍ Laura Bahiense; Gordana Manić; Breno Piva; Cid C. de Souza 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 389 KB

A polyhedral study of the network pricin

✍ Géraldine Heilporn; Martine Labbé; Patrice Marcotte; Gilles Savard 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 392 KB

Approximation algorithm for the minimum

✍ Zhang, Yaping; Shi, Yishuo; Zhang, Zhao 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 212 KB

Parameterized complexity of connected ev

✍ Fomin, Fedor V.; Golovach, Petr A. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 923 KB