The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase Connected facility location (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
2002-2008 (15) 2009-2011 (9)
Publication types (Num. hits)
article(10) inproceedings(14)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 29 occurrences of 19 keywords

Results
Found 24 publication records. Showing 24 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
3Mohammad Khairul Hasan, Hyunwoo Jung, Kyung-Yong Chwa Approximation algorithms for connected facility location problems. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Approximation algorithms, Integer programming, Steiner tree, LP-rounding, Connected facility location
3Alessandro Tomazic, Ivana Ljubic A GRASP Algorithm for the Connected Facility Location Problem. Search on Bibsonomy SAINT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF GRASP, Connected Facility Location
3Chaitanya Swamy, Amit Kumar 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
2Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Rothvoß, Guido Schäfer Approximating connected facility location problems via random facility sampling and core detouring. Search on Bibsonomy SODA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Hyunwoo Jung, Mohammad Khairul Hasan, Kyung-Yong Chwa Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem. Search on Bibsonomy COCOA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Approximation algorithms, Primal-Dual algorithms, Facility location problem
2Markus Leitner, Günther R. Raidl Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem. Search on Bibsonomy SAINT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Network Design, Integer Linear Programming, Variable Neighborhood Search, Connected Facility Location
2Mohammad Khairul Hasan, Hyunwoo Jung, Kyung-Yong Chwa Improved Approximation Algorithm for Connected Facility Location Problems. Search on Bibsonomy COCOA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Ivana Ljubic A Hybrid VNS for Connected Facility Location. Search on Bibsonomy Hybrid Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Stefano Leonardi, Guido Schäfer Cross-monotonic cost-sharing methods for connected facility location games. Search on Bibsonomy ACM Conference on Electronic Commerce The full citation details ... 2004 DBLP  DOI  BibTeX  RDF mechanism design, cost sharing, connected facility location
2Chaitanya Swamy, Amit Kumar Primal-Dual Algorithms for Connected Facility Location Problems. Search on Bibsonomy APPROX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Markus Leitner, Günther R. Raidl Branch-and-Cut-and-Price for Capacitated Connected Facility Location. Search on Bibsonomy J. Math. Model. Algorithms The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Stefan Gollowitzer, Ivana Ljubic MIP models for connected facility location: A theoretical and computational study. Search on Bibsonomy Computers & OR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ashwin Arulselvan, Andreas Bley, Stefan Gollowitzer, Ivana Ljubic, Olaf Maurer MIP Modeling of Incremental Connected Facility Location. Search on Bibsonomy INOC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Fabrizio Grandoni, Thomas Rothvoß Approximation Algorithms for Single and Multi-Commodity Connected Facility Location. Search on Bibsonomy IPCO The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Markus Leitner, Günther R. Raidl Variable Neighborhood and Greedy Randomized Adaptive Search for Capacitated Connected Facility Location. Search on Bibsonomy EUROCAST The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ivana Ljubic, Stefan Gollowitzer Modelling the Hop Constrained Connected Facility Location Problem on Layered Graphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Rothvoß, Guido Schäfer Connected facility location via random facility sampling and core detouring. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1M. Gisela Bardossy, S. Raghavan Dual-Based Local Search for the Connected Facility Location and Related Problems. Search on Bibsonomy INFORMS Journal on Computing The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Hyunwoo Jung, Mohammad Khairul Hasan, Kyung-Yong Chwa A 6.55 factor primal-dual approximation algorithm for the connected facility location problem. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Anke van Zuylen Deterministic Sampling Algorithms for Network Design. Search on Bibsonomy ESA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Pavan Nuggehalli, Vikram Srinivasan, Carla-Fabiana Chiasserini, Ramesh R. Rao Efficient cache placement in multi-hop wireless networks. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF web cache placement, wireless multi-hop networks, heuristic optimization
1Stefano Leonardi, Guido Schäfer Cross-monotonic cost sharing methods for connected facility location games. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Pavan Nuggehalli, Vikram Srinivasan, Carla-Fabiana Chiasserini Energy-efficient caching strategies in ad hoc wireless networks. Search on Bibsonomy MobiHoc The full citation details ... 2003 DBLP  DOI  BibTeX  RDF ad hoc networks, caching
1Anupam Gupta, Amit Kumar, 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
Displaying result #1 - #24 of 24 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.