|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 18 occurrences of 16 keywords
|
|
|
Results
Found 29 publication records. Showing 29 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
26 | Adam Meyerson, Kamesh Munagala, Serge A. Plotkin |
Cost-Distance: Two Metric Network Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 624-630, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
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 |
24 | Julia Chuzhoy, Anupam Gupta 0001, Joseph Naor, Amitabh Sinha |
On the approximability of some network design problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(2), pp. 23:1-23:17, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
cost-distance, fixed charge network flow, priority Steiner tree, network design, Hardness of approximation |
20 | Christian Schindelhauer, Birgitta Weber |
Tree-Approximations for the Weighted Cost-Distance Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings, pp. 185-195, 2001, Springer, 3-540-42985-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
20 | Yong-Hyuk Kim, Byung Ro Moon |
Investigation of the Fitness Landscapes in Graph Bipartitioning: An Empirical Study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 10(2), pp. 111-133, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
cost surface, cost-distance correlation, central point, heuristic algorithm, graph bipartitioning |
11 | Abdel-Halim Smai, Lars-Erik Thorelli |
Distance-Based Flow Control in Wormhole Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PCRCW ![In: Parallel Computer Routing and Communication, Second International Workshop, PCRCW'97, Atlanta, Georgia, USA, June 26-27, 1997, Proceedings, pp. 189-202, 1997, Springer, 3-540-64571-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
11 | Katherine Ho, Rebecca W. Loraamm |
Using a Cost-Distance Time-Geographic Approach to Identify Red Deer Habitat Use in Banff National Park, Alberta, Canada. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPRS Int. J. Geo Inf. ![In: ISPRS Int. J. Geo Inf. 12(8), pp. 339, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
11 | Josefine Foos, Stephan Held, Yannik Kyle Dustin Spitzley |
Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.03381, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
11 | Josefine Foos, Stephan Held, Yannik Kyle Dustin Spitzley |
Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 19:1-19:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
11 | Stephan Held, Yannik Kyle Dustin Spitzley |
Further Improvements on Approximating the Uniform Cost-Distance Steiner Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.03830, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
11 | Shoei Nashimoto, Daisuke Suzuki, Noriyuki Miura, Tatsuya Machida, Kohei Matsuda, Makoto Nagata |
Low-cost distance-spoofing attack on FMCW radar and its feasibility study on countermeasure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptogr. Eng. ![In: J. Cryptogr. Eng. 11(3), pp. 289-298, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
11 | Yaqian Chen, Jiangfeng She, Xingong Li, Shuhua Zhang, Junzhong Tan |
Accurate and Efficient Calculation of Three-Dimensional Cost Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPRS Int. J. Geo Inf. ![In: ISPRS Int. J. Geo Inf. 9(6), pp. 353, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
11 | Ardalan Khazraei, Stephan Held |
An Improved Approximation Algorithm for the Uniform Cost-Distance Steiner Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms - 18th International Workshop, WAOA 2020, Virtual Event, September 9-10, 2020, Revised Selected Papers, pp. 189-203, 2020, Springer, 978-3-030-80878-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
11 | Daniel Becker 0005, María de Andrés-Herrero, Christian Willmes, Gerd-Christian Weniger, Georg Bareth |
Investigating the Influence of Different DEMs on GIS-Based Cost Distance Modeling for Site Catchment Analysis of Prehistoric Sites in Andalusia. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPRS Int. J. Geo Inf. ![In: ISPRS Int. J. Geo Inf. 6(2), pp. 36, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
11 | Georg von Zengen, Yannic Schröder, Stephan Rottmann, Felix Büsching, Lars C. Wolf |
No-cost distance estimation using standard WSN radios. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOCOM ![In: 35th Annual IEEE International Conference on Computer Communications, INFOCOM 2016, San Francisco, CA, USA, April 10-14, 2016, pp. 1-9, 2016, IEEE, 978-1-4673-9953-1. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
11 | Narayan Murmu, Debashis Nandi |
Low cost distance estimation system using low resolution single camera and high radius convex mirrors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICACCI ![In: 2014 International Conference on Advances in Computing, Communications and Informatics, ICACCI 2014, Delhi, India, September 24-27, 2014, pp. 998-1003, 2014, IEEE, 978-1-4799-3078-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
11 | Jonathan A. Greenberg, Carlos Rueda, Erin L. Hestir, Maria João Santos, Susan L. Ustin |
Least cost distance analysis for spatial interpolation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Geosci. ![In: Comput. Geosci. 37(2), pp. 272-276, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
11 | Guan Huang, Seng Wai Loke |
Gesture-Based Easy-Computer Interaction Using a Linear Array of Low Cost Distance Sensors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DASC ![In: IEEE Ninth International Conference on Dependable, Autonomic and Secure Computing, DASC 2011, 12-14 December 2011, Sydney, Australia, pp. 246-251, 2011, IEEE Computer Society, 978-0-7695-4612-4. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
11 | Adam Meyerson, Kamesh Munagala, Serge A. Plotkin |
Cost-Distance: Two Metric Network Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 38(4), pp. 1648-1659, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
11 | Xin Zhang, Guofeng Cao, Lili Zhang |
Research and Improvement on Optimal Path Analysis Algorithm Based on Cost-Distance Grid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IGARSS ![In: IEEE International Geoscience & Remote Sensing Symposium, IGARSS 2006, July 31 - August 4, 2006, Denver, Colorado, USA, Proceedings, pp. 869-871, 2006, IEEE, 0-7803-9509-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
11 | Chandra Chekuri, Sanjeev Khanna, Joseph Naor |
A deterministic algorithm for the cost-distance problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA., pp. 232-233, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
11 | Partha Pratim Das, Jayanta Mukherjee 0001, B. N. Chatterji |
The t-Cost distance in digital geometry. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 59(1-2), pp. 1-20, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
9 | Julia Chuzhoy, Anupam Gupta 0001, Joseph Naor, Amitabh Sinha |
On the approximability of some network design problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 943-951, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
5 | András Bakó, Péter Földesi, István Szüts |
Determination the Basic Network Algorithms with Gains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Towards Intelligent Engineering and Information Technology ![In: Towards Intelligent Engineering and Information Technology, pp. 447-456, 2009, Springer, 978-3-642-03736-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Gain function, shortest path with gain, maximal flow, multiterminal minimal path |
5 | Guy Kortsarz, Zeev Nutov |
Approximating Some Network Design Problems with Node Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings, pp. 231-243, 2009, Springer, 978-3-642-03684-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Node costs, Multicommodity Buy at Bulk, Covering tree, Approximation algorithm, Network design, Hardness of approximation |
5 | Beatrice M. Ombuki, Brian Ross, Franklin Hanshar |
Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Intell. ![In: Appl. Intell. 24(1), pp. 17-30, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
vehicle routing problem with time windows (VRPTW), multi-objective optimization Pareto ranking, genetic algorithm |
4 | Leong Hou U, Nikos Mamoulis, Kyriakos Mouratidis |
Efficient Evaluation of Multiple Preference Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 25th International Conference on Data Engineering, ICDE 2009, March 29 2009 - April 2 2009, Shanghai, China, pp. 1251-1254, 2009, IEEE Computer Society, 978-0-7695-3545-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
4 | Wenjun Liu, Yue Sun, Jiguo Yu, Baoxiang Cao |
A Grid-Based Distributed Multi-Hop Routing Protocol for Wireless Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUC (1) ![In: 2008 IEEE/IPIP International Conference on Embedded and Ubiquitous Computing (EUC 2008), Shanghai, China, December 17-20, 2008, Volume I, pp. 330-336, 2008, IEEE Computer Society, 978-0-7695-3492-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
4 | Anupam Gupta 0001, MohammadTaghi Hajiaghayi, Amit Kumar 0001 |
Stochastic Steiner Tree with Non-uniform Inflation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings, pp. 134-148, 2007, Springer, 978-3-540-74207-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
4 | Yong-Hyuk Kim, Byung Ro Moon |
Investigation of the Fitness Landscapes and Multi-parent Crossover for Graph Bipartitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation - GECCO 2003, Genetic and Evolutionary Computation Conference, Chicago, IL, USA, July 12-16, 2003. Proceedings, Part I, pp. 1123-1135, 2003, Springer, 3-540-40602-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #29 of 29 (100 per page; Change: )
|
|