Search results for "buy-at-bulk"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
104	Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour	Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees.	Algorithmica	2009	DBLP DOI BibTeX RDF
88	Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour	Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
86	Ashish Goel, Deborah Estrin	Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk.	Algorithmica	2005	DBLP DOI BibTeX RDF	Buy-at-bulk, Optimization
86	Moses Charikar, Adriana Karagiozova	On non-uniform multicommodity buy-at-bulk network design.	STOC	2005	DBLP DOI BibTeX RDF	buy-at-bulk, multicommodity, approximation algorithms, network design, non-uniform
86	Baruch Awerbuch, Yossi Azar	Buy-at-Bulk Network Design.	FOCS	1997	DBLP DOI BibTeX RDF	buy-at-bulk network design, central network switch, multi-sink network design, selective network design, Generalized Steiner Connectivity, Prize-collecting salesman, K-MST, connectivity, network routing, network capacity
78	Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson 0001, Andrzej Lingas, Pawel Zylinski	Approximation Algorithms for Buy-at-Bulk Geometric Network Design.	WADS	2009	DBLP DOI BibTeX RDF
78	Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour	Approximation algorithms for node-weighted buy-at-bulk network design.	SODA	2007	DBLP BibTeX RDF
75	Guy Kortsarz, Zeev Nutov	Approximating Some Network Design Problems with Node Costs.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF	Node costs, Multicommodity Buy at Bulk, Covering tree, Approximation algorithm, Network design, Hardness of approximation
62	Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce Shepherd, Lisa Zhang	Buy-at-Bulk Network Design with Protection.	FOCS	2007	DBLP DOI BibTeX RDF
62	Matthew Andrews	Hardness of Buy-at-Bulk Network Design.	FOCS	2004	DBLP DOI BibTeX RDF
62	Kunal Talwar	The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap.	IPCO	2002	DBLP DOI BibTeX RDF
61	Amit Kumar 0001, Anupam Gupta 0001, Tim Roughgarden	A Constant-Factor Approximation Algorithm for the Multicommodity.	FOCS	2002	DBLP DOI BibTeX RDF
45	Fabrizio Grandoni 0001, Giuseppe F. Italiano	Improved Approximation for Single-Sink Buy-at-Bulk.	ISAAC	2006	DBLP DOI BibTeX RDF
45	Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour	Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design.	FOCS	2006	DBLP DOI BibTeX RDF
45	Raja Jothi, Balaji Raghavachari	Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems.	SWAT	2004	DBLP DOI BibTeX RDF
45	Ashish Goel, Deborah Estrin	Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk.	SODA	2003	DBLP BibTeX RDF
45	Naveen Garg 0001, Rohit Khandekar, Goran Konjevod, R. Ravi 0001, F. Sibel Salman, Amitabh Sinha II	On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem.	IPCO	2001	DBLP DOI BibTeX RDF
41	Adam Meyerson, Kamesh Munagala, Serge A. Plotkin	Cost-Distance: Two Metric Network Design.	FOCS	2000	DBLP DOI BibTeX RDF	cost-distance problem, 2-metric network design, edge cost sum optimization, source-sink distance sum optimization, randomized approximation scheme, source number, logarithmic approximation, single-sink buy-at-bulk problem, variable pipe types, single-source multicast trees, delay properties, multi-level facility location, computational complexity, trees (mathematics), cost, Steiner tree, facility location, telecommunication network routing, edges, approximation theory, randomised algorithms, network synthesis
35	Chaitanya Swamy, Amit Kumar 0001	Primal-Dual Algorithms for Connected Facility Location Problems.	Algorithmica	2004	DBLP DOI BibTeX RDF	Approximation algorithms, Steiner trees, Facility location, Primal-dual algorithms, Connected facility location
28	Chaghoub Soraya, Ibrahima Diarrassouba	A Polyhedral Study for the Buy-at-Bulk Facility Location Problem.	ISCO	2020	DBLP DOI BibTeX RDF
28	Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, José A. Soto	LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design.	Algorithmica	2019	DBLP DOI BibTeX RDF
28	Deeparnab Chakrabarty, Alina Ene, Ravishankar Krishnaswamy, Debmalya Panigrahi	Online Buy-at-Bulk Network Design.	SIAM J. Comput.	2018	DBLP DOI BibTeX RDF
28	Ashwin Arulselvan, Mohsen Rezapour, Wolfgang A. Welz	Exact Approaches for Designing Multifacility Buy-at-Bulk Networks.	INFORMS J. Comput.	2017	DBLP DOI BibTeX RDF
28	Anupam Gupta 0001, R. Ravi 0001, Kunal Talwar, Seeun William Umboh	LAST but not Least: Online Spanners for Buy-at-Bulk.	SODA	2017	DBLP DOI BibTeX RDF
28	Anupam Gupta 0001, R. Ravi 0001, Kunal Talwar, Seeun William Umboh	LAST but not Least: Online Spanners for Buy-at-Bulk.	CoRR	2016	DBLP BibTeX RDF
28	Andreas Bley, Mohsen Rezapour	Combinatorial approximation algorithms for buy-at-bulk connected facility location problems.	Discret. Appl. Math.	2016	DBLP DOI BibTeX RDF
28	M. Reza Khani, Mohammad R. Salavatipour	Improved approximations for buy-at-bulk and shallow-light k-Steiner trees and (k, 2)-subgraph.	J. Comb. Optim.	2016	DBLP DOI BibTeX RDF
28	Deeparnab Chakrabarty, Alina Ene, Ravishankar Krishnaswamy, Debmalya Panigrahi	Online Buy-at-Bulk Network Design.	CoRR	2015	DBLP BibTeX RDF
28	Alina Ene, Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Debmalya Panigrahi	Online Buy-at-Bulk Network Design.	FOCS	2015	DBLP DOI BibTeX RDF
28	Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, José A. Soto	LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design.	WADS	2015	DBLP DOI BibTeX RDF
28	Peng Zhang 0008	A new approximation algorithm for the Selective Single-Sink Buy-at-Bulk problem in network design.	J. Comb. Optim.	2014	DBLP DOI BibTeX RDF
28	Andreas Bley, Mohsen Rezapour	Approximating connected facility location with buy-at-bulk edge costs via random sampling.	Electron. Notes Discret. Math.	2013	DBLP DOI BibTeX RDF
28	Andreas Bley, S. Mehdi Hashemi, Mohsen Rezapour	Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem.	TAMC	2013	DBLP DOI BibTeX RDF
28	Ashish Goel, Ian Post	One Tree Suffices: A Simultaneous O(1)-Approximation for Single-Sink Buy-at-Bulk.	Theory Comput.	2012	DBLP DOI BibTeX RDF
28	Srinivasagopalan Srivathsan, Costas Busch, S. S. Iyengar 0001	An Oblivious Spanning Tree for Single-Sink Buy-at-Bulk in Low Doubling-Dimension Graphs.	IEEE Trans. Computers	2012	DBLP DOI BibTeX RDF
28	Guy E. Blelloch, Anupam Gupta 0001, Kanat Tangwongsan	Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design.	SPAA	2012	DBLP DOI BibTeX RDF
28	Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce Shepherd, Lisa Zhang	Buy-at-Bulk Network Design with Protection.	Math. Oper. Res.	2011	DBLP DOI BibTeX RDF
28	Fabrizio Grandoni 0001, Thomas Rothvoß, Laura Sanità	From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk.	Math. Oper. Res.	2011	DBLP DOI BibTeX RDF
28	Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson 0001, Andrzej Lingas, Pawel Zylinski	Approximation Algorithms for Buy-at-Bulk Geometric Network Design.	Int. J. Found. Comput. Sci.	2011	DBLP DOI BibTeX RDF
28	M. Reza Khani, Mohammad R. Salavatipour	Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k, 2)-Subgraph.	ISAAC	2011	DBLP DOI BibTeX RDF
28	Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar	Oblivious Buy-at-Bulk in Planar Graphs.	WALCOM	2011	DBLP DOI BibTeX RDF
28	Peng Zhang 0008	A New Approximation Algorithm for the Selective Single-Sink Buy-at-Bulk Problem in Network Design.	COCOA	2011	DBLP DOI BibTeX RDF
28	Ashish Goel, Ian Post	One Tree Suffices: A Simultaneous O(1)-Approximation for Single-Sink Buy-at-Bulk	CoRR	2010	DBLP BibTeX RDF
28	Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar	An Oblivious Spanning Tree for Buy-at-Bulk Network Design Problems	CoRR	2010	DBLP BibTeX RDF
28	Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar	Oblivious Buy-at-Bulk in Planar Graphs	CoRR	2010	DBLP BibTeX RDF
28	Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour	Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design.	SIAM J. Comput.	2010	DBLP DOI BibTeX RDF
28	Ashish Goel, Ian Post	One Tree Suffices: A Simultaneous O(1)-Approximation for Single-Sink Buy-at-Bulk.	FOCS	2010	DBLP DOI BibTeX RDF
28	Spyridon Antonakopoulos	Approximating Directed Buy-at-Bulk Network Design.	WAOA	2010	DBLP DOI BibTeX RDF
28	Raja Jothi, Balaji Raghavachari	Improved approximation algorithms for the single-sink buy-at-bulk network design problems.	J. Discrete Algorithms	2009	DBLP DOI BibTeX RDF
28	Ashish Goel, Ian Post	An Oblivious O(1)-Approximation for Single Source Buy-at-Bulk	CoRR	2009	DBLP BibTeX RDF
28	Ashish Goel, Ian Post	An Oblivious O(1)-Approximation for Single Source Buy-at-Bulk.	FOCS	2009	DBLP DOI BibTeX RDF	Approximation Algorithms, Network Design
28	Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour	Approximating Buy-at-Bulk k-Steiner trees	Electron. Colloquium Comput. Complex.	2006	DBLP BibTeX RDF
28	Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour	Polylogarithmic Approximation Algorithm for Non-Uniform Multicommodity Buy-at-Bulk	Electron. Colloquium Comput. Complex.	2006	DBLP BibTeX RDF
28	F. Sibel Salman, Joseph Cheriyan, R. Ravi 0001, S. Subramanian	Buy-at-Bulk Network Design: Approximating the Single-Sink Edge Installation Problem.	SODA	1997	DBLP DOI BibTeX RDF
26	Anupam Gupta 0001, Amit Kumar 0001, Martin Pál, Tim Roughgarden	Approximation via cost sharing: Simpler and better approximation algorithms for network design.	J. ACM	2007	DBLP DOI BibTeX RDF	Approximation algorithms, network design, random sampling, cost sharing
17	Xujin Chen, Bo Chen 0002	Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design.	Algorithmica	2009	DBLP DOI BibTeX RDF	Soft capacity, Approximation algorithm, Network design, Facility location, Performance guarantee
17	Anke van Zuylen	Deterministic Sampling Algorithms for Network Design.	ESA	2008	DBLP DOI BibTeX RDF
17	Martin Hoefer 0001	Competitive Cost Sharing with Economies of Scale.	LATIN	2008	DBLP DOI BibTeX RDF
17	R. Ravi 0001	Matching Based Augmentations for Approximating Connectivity Problems.	LATIN	2006	DBLP DOI BibTeX RDF
17	Jittat Fakcharoenphol, Satish Rao, Kunal Talwar	A tight bound on approximating arbitrary metrics by tree metrics.	STOC	2003	DBLP DOI BibTeX RDF	metrics, embeddings, tree metrics
17	Anupam Gupta 0001, Amit Kumar 0001, Tim Roughgarden	Simpler and better approximation algorithms for network design.	STOC	2003	DBLP DOI BibTeX RDF	approximation algorithms, randomized algorithms, network design
17	Sudipto Guha, Adam Meyerson, Kamesh Munagala	A constant factor approximation for the single sink edge installation problems.	STOC	2001	DBLP DOI BibTeX RDF
17	Moses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha, Serge A. Plotkin	Approximating a Finite Metric by a Small Number of Tree Metrics.	FOCS	1998	DBLP DOI BibTeX RDF	probabilistic approximation of metric spaces, low diameter partitioning, real normed spaces, algorithms, linear programming, approximation, metric space, derandomization, tree metric