The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase buy-at-bulk (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1997-2005 (16) 2006-2009 (18) 2010-2012 (15) 2013-2020 (14)
Publication types (Num. hits)
article(27) inproceedings(36)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 47 occurrences of 32 keywords

Results
Found 63 publication records. Showing 63 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
104Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
88Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
86Ashish Goel, Deborah Estrin Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk. Search on Bibsonomy Algorithmica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Buy-at-bulk, Optimization
86Moses Charikar, Adriana Karagiozova On non-uniform multicommodity buy-at-bulk network design. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF buy-at-bulk, multicommodity, approximation algorithms, network design, non-uniform
86Baruch Awerbuch, Yossi Azar Buy-at-Bulk Network Design. Search on Bibsonomy FOCS The full citation details ... 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
78Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson 0001, Andrzej Lingas, Pawel Zylinski Approximation Algorithms for Buy-at-Bulk Geometric Network Design. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
78Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour Approximation algorithms for node-weighted buy-at-bulk network design. Search on Bibsonomy SODA The full citation details ... 2007 DBLP  BibTeX  RDF
75Guy Kortsarz, Zeev Nutov Approximating Some Network Design Problems with Node Costs. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Node costs, Multicommodity Buy at Bulk, Covering tree, Approximation algorithm, Network design, Hardness of approximation
62Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce Shepherd, Lisa Zhang Buy-at-Bulk Network Design with Protection. Search on Bibsonomy FOCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
62Matthew Andrews Hardness of Buy-at-Bulk Network Design. Search on Bibsonomy FOCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
62Kunal Talwar The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap. Search on Bibsonomy IPCO The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
61Amit Kumar 0001, Anupam Gupta 0001, Tim Roughgarden A Constant-Factor Approximation Algorithm for the Multicommodity. Search on Bibsonomy FOCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
45Fabrizio Grandoni 0001, Giuseppe F. Italiano Improved Approximation for Single-Sink Buy-at-Bulk. Search on Bibsonomy ISAAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
45Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design. Search on Bibsonomy FOCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
45Raja Jothi, Balaji Raghavachari Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems. Search on Bibsonomy SWAT The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
45Ashish Goel, Deborah Estrin Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk. Search on Bibsonomy SODA The full citation details ... 2003 DBLP  BibTeX  RDF
45Naveen 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. Search on Bibsonomy IPCO The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
41Adam Meyerson, Kamesh Munagala, Serge A. Plotkin Cost-Distance: Two Metric Network Design. Search on Bibsonomy FOCS The full citation details ... 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
35Chaitanya Swamy, Amit Kumar 0001 Primal-Dual Algorithms for Connected Facility Location Problems. Search on Bibsonomy Algorithmica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Approximation algorithms, Steiner trees, Facility location, Primal-dual algorithms, Connected facility location
28Chaghoub Soraya, Ibrahima Diarrassouba A Polyhedral Study for the Buy-at-Bulk Facility Location Problem. Search on Bibsonomy ISCO The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
28Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, José A. Soto LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
28Deeparnab Chakrabarty, Alina Ene, Ravishankar Krishnaswamy, Debmalya Panigrahi Online Buy-at-Bulk Network Design. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
28Ashwin Arulselvan, Mohsen Rezapour, Wolfgang A. Welz Exact Approaches for Designing Multifacility Buy-at-Bulk Networks. Search on Bibsonomy INFORMS J. Comput. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
28Anupam Gupta 0001, R. Ravi 0001, Kunal Talwar, Seeun William Umboh LAST but not Least: Online Spanners for Buy-at-Bulk. Search on Bibsonomy SODA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
28Anupam Gupta 0001, R. Ravi 0001, Kunal Talwar, Seeun William Umboh LAST but not Least: Online Spanners for Buy-at-Bulk. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
28Andreas Bley, Mohsen Rezapour Combinatorial approximation algorithms for buy-at-bulk connected facility location problems. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
28M. Reza Khani, Mohammad R. Salavatipour Improved approximations for buy-at-bulk and shallow-light k-Steiner trees and (k, 2)-subgraph. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
28Deeparnab Chakrabarty, Alina Ene, Ravishankar Krishnaswamy, Debmalya Panigrahi Online Buy-at-Bulk Network Design. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
28Alina Ene, Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Debmalya Panigrahi Online Buy-at-Bulk Network Design. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
28Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, José A. Soto LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design. Search on Bibsonomy WADS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
28Peng Zhang 0008 A new approximation algorithm for the Selective Single-Sink Buy-at-Bulk problem in network design. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
28Andreas Bley, Mohsen Rezapour Approximating connected facility location with buy-at-bulk edge costs via random sampling. Search on Bibsonomy Electron. Notes Discret. Math. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
28Andreas Bley, S. Mehdi Hashemi, Mohsen Rezapour Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem. Search on Bibsonomy TAMC The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
28Ashish Goel, Ian Post One Tree Suffices: A Simultaneous O(1)-Approximation for Single-Sink Buy-at-Bulk. Search on Bibsonomy Theory Comput. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
28Srinivasagopalan Srivathsan, Costas Busch, S. S. Iyengar 0001 An Oblivious Spanning Tree for Single-Sink Buy-at-Bulk in Low Doubling-Dimension Graphs. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
28Guy E. Blelloch, Anupam Gupta 0001, Kanat Tangwongsan Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design. Search on Bibsonomy SPAA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
28Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce Shepherd, Lisa Zhang Buy-at-Bulk Network Design with Protection. Search on Bibsonomy Math. Oper. Res. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
28Fabrizio Grandoni 0001, Thomas Rothvoß, Laura Sanità From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk. Search on Bibsonomy Math. Oper. Res. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
28Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson 0001, Andrzej Lingas, Pawel Zylinski Approximation Algorithms for Buy-at-Bulk Geometric Network Design. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
28M. Reza Khani, Mohammad R. Salavatipour Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k, 2)-Subgraph. Search on Bibsonomy ISAAC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
28Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar Oblivious Buy-at-Bulk in Planar Graphs. Search on Bibsonomy WALCOM The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
28Peng Zhang 0008 A New Approximation Algorithm for the Selective Single-Sink Buy-at-Bulk Problem in Network Design. Search on Bibsonomy COCOA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
28Ashish Goel, Ian Post One Tree Suffices: A Simultaneous O(1)-Approximation for Single-Sink Buy-at-Bulk Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
28Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar An Oblivious Spanning Tree for Buy-at-Bulk Network Design Problems Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
28Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar Oblivious Buy-at-Bulk in Planar Graphs Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
28Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
28Ashish Goel, Ian Post One Tree Suffices: A Simultaneous O(1)-Approximation for Single-Sink Buy-at-Bulk. Search on Bibsonomy FOCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
28Spyridon Antonakopoulos Approximating Directed Buy-at-Bulk Network Design. Search on Bibsonomy WAOA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
28Raja Jothi, Balaji Raghavachari Improved approximation algorithms for the single-sink buy-at-bulk network design problems. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
28Ashish Goel, Ian Post An Oblivious O(1)-Approximation for Single Source Buy-at-Bulk Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
28Ashish Goel, Ian Post An Oblivious O(1)-Approximation for Single Source Buy-at-Bulk. Search on Bibsonomy FOCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Approximation Algorithms, Network Design
28Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour Approximating Buy-at-Bulk k-Steiner trees Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2006 DBLP  BibTeX  RDF
28Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour Polylogarithmic Approximation Algorithm for Non-Uniform Multicommodity Buy-at-Bulk Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2006 DBLP  BibTeX  RDF
28F. Sibel Salman, Joseph Cheriyan, R. Ravi 0001, S. Subramanian Buy-at-Bulk Network Design: Approximating the Single-Sink Edge Installation Problem. Search on Bibsonomy SODA The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
26Anupam Gupta 0001, Amit Kumar 0001, Martin Pál, Tim Roughgarden Approximation via cost sharing: Simpler and better approximation algorithms for network design. Search on Bibsonomy J. ACM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Approximation algorithms, network design, random sampling, cost sharing
17Xujin Chen, Bo Chen 0002 Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Soft capacity, Approximation algorithm, Network design, Facility location, Performance guarantee
17Anke van Zuylen Deterministic Sampling Algorithms for Network Design. Search on Bibsonomy ESA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
17Martin Hoefer 0001 Competitive Cost Sharing with Economies of Scale. Search on Bibsonomy LATIN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
17R. Ravi 0001 Matching Based Augmentations for Approximating Connectivity Problems. Search on Bibsonomy LATIN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
17Jittat Fakcharoenphol, Satish Rao, Kunal Talwar A tight bound on approximating arbitrary metrics by tree metrics. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF metrics, embeddings, tree metrics
17Anupam Gupta 0001, Amit Kumar 0001, Tim Roughgarden Simpler and better approximation algorithms for network design. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF approximation algorithms, randomized algorithms, network design
17Sudipto Guha, Adam Meyerson, Kamesh Munagala A constant factor approximation for the single sink edge installation problems. Search on Bibsonomy STOC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
17Moses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha, Serge A. Plotkin Approximating a Finite Metric by a Small Number of Tree Metrics. Search on Bibsonomy FOCS The full citation details ... 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
Displaying result #1 - #63 of 63 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license