Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design

2012 IEEE 53rd Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2012.30 ◽

2012 ◽

Author(s):

Takuro Fukunaga ◽

R. Ravi

Keyword(s):

Approximation Algorithms ◽

Network Design ◽

Node Connectivity

Download Full-text

Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design

SIAM Journal on Computing ◽

10.1137/13094503x ◽

2015 ◽

Vol 44 (5) ◽

pp. 1202-1229 ◽

Author(s):

Takuro Fukunaga ◽

Zeev Nutov ◽

R. Ravi

Keyword(s):

Approximation Algorithms ◽

Network Design ◽

Node Connectivity

Download Full-text

Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements

Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC '14 ◽

10.1145/2591796.2591837 ◽

2014 ◽

Author(s):

Alina Ene ◽

Ali Vakilian

Keyword(s):

Approximation Algorithms ◽

Network Design ◽

Design Problems ◽

Network Design Problems ◽

Node Connectivity

Download Full-text

Approximation Algorithms for a Directed Network Design Problem

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/3-540-48777-8_26 ◽

1999 ◽

pp. 345-360 ◽

Author(s):

Vardges Melkonian ◽

Éva Tardos

Keyword(s):

Approximation Algorithms ◽

Network Design ◽

Design Problem ◽

Network Design Problem ◽

Directed Network

Download Full-text

Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27836-8_68 ◽

2004 ◽

pp. 805-818 ◽

Author(s):

Raja Jothi ◽

Balaji Raghavachari

Keyword(s):

Approximation Algorithms ◽

Network Design ◽

Spanning Tree ◽

Minimum Spanning Tree ◽

Capacitated Minimum Spanning Tree ◽

Minimum Spanning Tree Problem

Download Full-text

Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-93980-1_14 ◽

2009 ◽

pp. 174-187 ◽

Author(s):

Chandrashekhar Nagarajan ◽

Yogeshwer Sharma ◽

David P. Williamson

Keyword(s):

Approximation Algorithms ◽

Network Design ◽

Design Problems ◽

Network Design Problems ◽

Prize Collecting

Download Full-text

Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/3-540-47867-1_16 ◽

2002 ◽

pp. 212-229 ◽

Author(s):

Ramamoorthi Ravi ◽

Amitabh Sinha

Keyword(s):

Approximation Algorithms ◽

Network Design ◽

Facility Location ◽

Integrated Logistics

Download Full-text

Simpler and better approximation algorithms for network design

Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03 ◽

10.1145/780542.780597 ◽

2003 ◽

Author(s):

Anupam Gupta ◽

Amit Kumar ◽

Tim Roughgarden

Keyword(s):

Approximation Algorithms ◽

Download Full-text

Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design

Algorithmica ◽

10.1007/s00453-007-9032-7 ◽

2007 ◽

Vol 53 (3) ◽

pp. 263-297 ◽

Author(s):

Xujin Chen ◽

Bo Chen

Keyword(s):

Approximation Algorithms ◽

Network Design ◽

Facility Location ◽

Capacitated Facility Location ◽

Capacitated Network ◽

Capacitated Network Design

Download Full-text

Network design with node connectivity constraints

Proceedings of the 2003 IFIP/ACM Latin America conference on Towards a Latin American agenda for network research - LANC '03 ◽

10.1145/1035662.1035664 ◽

2003 ◽

Author(s):

H�ctor Cancela ◽

Franco Robledo ◽

Gerardo Rubino

Keyword(s):

Network Design ◽

Node Connectivity

Download Full-text

Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design

ACM Transactions on Algorithms ◽

10.1145/1103963.1103967 ◽

2005 ◽

Vol 1 (2) ◽

pp. 265-282 ◽

Author(s):

Raja Jothi ◽

Balaji Raghavachari

Keyword(s):

Approximation Algorithms ◽

Network Design ◽

Spanning Tree ◽

Minimum Spanning Tree ◽

Capacitated Minimum Spanning Tree ◽

Minimum Spanning Tree Problem

Download Full-text