Search results for "cost-distance"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
26	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
24	Julia Chuzhoy, Anupam Gupta 0001, Joseph Naor, Amitabh Sinha	On the approximability of some network design problems.	ACM Trans. Algorithms	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.	ISAAC	2001	DBLP DOI BibTeX RDF
20	Yong-Hyuk Kim, Byung Ro Moon	Investigation of the Fitness Landscapes in Graph Bipartitioning: An Empirical Study.	J. Heuristics	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.	PCRCW	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.	ISPRS Int. J. Geo Inf.	2023	DBLP DOI BibTeX RDF
11	Josefine Foos, Stephan Held, Yannik Kyle Dustin Spitzley	Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem.	CoRR	2023	DBLP DOI BibTeX RDF
11	Josefine Foos, Stephan Held, Yannik Kyle Dustin Spitzley	Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem.	APPROX/RANDOM	2023	DBLP DOI BibTeX RDF
11	Stephan Held, Yannik Kyle Dustin Spitzley	Further Improvements on Approximating the Uniform Cost-Distance Steiner Tree Problem.	CoRR	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.	J. Cryptogr. Eng.	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.	ISPRS Int. J. Geo Inf.	2020	DBLP DOI BibTeX RDF
11	Ardalan Khazraei, Stephan Held	An Improved Approximation Algorithm for the Uniform Cost-Distance Steiner Tree Problem.	WAOA	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.	ISPRS Int. J. Geo Inf.	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.	INFOCOM	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.	ICACCI	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.	Comput. Geosci.	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.	DASC	2011	DBLP DOI BibTeX RDF
11	Adam Meyerson, Kamesh Munagala, Serge A. Plotkin	Cost-Distance: Two Metric Network Design.	SIAM J. Comput.	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.	IGARSS	2006	DBLP DOI BibTeX RDF
11	Chandra Chekuri, Sanjeev Khanna, Joseph Naor	A deterministic algorithm for the cost-distance problem.	SODA	2001	DBLP BibTeX RDF
11	Partha Pratim Das, Jayanta Mukherjee 0001, B. N. Chatterji	The t-Cost distance in digital geometry.	Inf. Sci.	1992	DBLP DOI BibTeX RDF
9	Julia Chuzhoy, Anupam Gupta 0001, Joseph Naor, Amitabh Sinha	On the approximability of some network design problems.	SODA	2005	DBLP BibTeX RDF
5	András Bakó, Péter Földesi, István Szüts	Determination the Basic Network Algorithms with Gains.	Towards Intelligent Engineering and Information Technology	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.	APPROX-RANDOM	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.	Appl. Intell.	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.	ICDE	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.	EUC (1)	2008	DBLP DOI BibTeX RDF
4	Anupam Gupta 0001, MohammadTaghi Hajiaghayi, Amit Kumar 0001	Stochastic Steiner Tree with Non-uniform Inflation.	APPROX-RANDOM	2007	DBLP DOI BibTeX RDF
4	Yong-Hyuk Kim, Byung Ro Moon	Investigation of the Fitness Landscapes and Multi-parent Crossover for Graph Bipartitioning.	GECCO	2003	DBLP DOI BibTeX RDF