|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 2281 occurrences of 1099 keywords
|
|
|
|
|
Results
Found 2435 publication records. Showing 2435 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 4 | Ramkumar Ramaswamy, James B. Orlin, Nilopal Chakravarti |
Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs.  |
Math. Program.  |
2005 |
DBLP DOI BibTeX RDF |
Bottleneck shortest path, Maximum capacity path problem, Sensitivity analysis, Shortest path problem |
| 4 | Hyungill Kim, Sungyoung Lee, Byeong-Soo Jeong |
An improved feasible shortest path real-time fault-tolerant scheduling algorithm.  |
RTCSA  |
2000 |
DBLP DOI BibTeX RDF |
feasible shortest path real time fault tolerant scheduling algorithm, real time single processor environment, queue based scheduling techniques, feasible shortest path algorithm, linear time heuristics, FSP algorithm, optimal fault tolerant schedules, LTH algorithm, real time scheduling performance, backup scheduling, minimum inter-fault time, primary tasks, fault tolerant schedule, backup schedules, scheduling, fault tolerance, real-time systems, computational complexity, fault tolerant computing, queueing theory, time complexity, timing constraints, system performance, greedy heuristics, time interval, real time computer systems |
| 4 | Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni |
Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees.  |
Algorithmica  |
1998 |
DBLP DOI BibTeX RDF |
Single-source shortest path, Output complexity, Single-source shortest path, Output complexity, Key words, Dynamic algorithms, Dynamic algorithms, Amortized complexity, Amortized complexity |
| 4 | Andrew Fetterer, Shashi Shekhar |
A Performance Analysis of Hierarchical Shortest Path Algorithms. (PDF / PS)  |
ICTAI  |
1997 |
DBLP DOI BibTeX RDF |
hierarchical shortest path algorithms, Advanced Traveler Information Systems, boundary graph, fragment graphs, fully memoized hierarchical routing algorithm, shortest-path data structure, real graph, storage overhead, Twin Cities metropolitan road-map, performance analysis, computer networks, computation time, metropolitan area networks |
| 4 | John K. Antonio, Garng M. Huang, Wei Kang Tsai |
A Fast Distributed Shortest Path Algorithm for a Class of Hierarchically Clustered Data Networks.  |
IEEE Trans. Computers  |
1992 |
DBLP DOI BibTeX RDF |
hierarchically clustered data networks, single-destination shortest path, parallel algorithms, computational complexity, graph theory, shortest path algorithm, all-pairs shortest path |
| 3 | Benjamin Doerr, Daniel Johannsen |
Edge-based representation beats vertex-based representation in shortest path problems.  |
GECCO  |
2010 |
DBLP DOI BibTeX RDF |
evolutionary algorithm, shortest path, runtime analysis |
| 3 | Christian Horoba, Dirk Sudholt |
Ant colony optimization for stochastic shortest path problems.  |
GECCO  |
2010 |
DBLP DOI BibTeX RDF |
combinatorial optimization, ant colony optimization, stochastic optimization, shortest path problems, running time analysis |
| 3 | Fang Wei |
TEDI: efficient shortest path query answering on graphs.  |
SIGMOD Conference  |
2010 |
DBLP DOI BibTeX RDF |
indexing, graphs, shortest path, tree decomposition |
| 3 | Rong Long Wang, Shan-Shan Guo, Kozo Okazaki |
A hill-jump algorithm of Hopfield neural network for shortest path problem in communication network.  |
Soft Comput.  |
2009 |
DBLP DOI BibTeX RDF |
Hill-jump algorithm, Hopfield neural network, Shortest path problem, Combinatorial optimization problem, Local minimum |
| 3 | Franz-Josef Brandenburg, Mao-cheng Cai |
Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains.  |
FAW  |
2009 |
DBLP DOI BibTeX RDF |
extended networks, lossy and gainy arcs, max-flow, unit-loss networks, shortest path, NP-hard |
| 3 | Atlas F. Cook, Carola Wenk |
Link Distance and Shortest Path Problems in the Plane.  |
AAIM  |
2009 |
DBLP DOI BibTeX RDF |
Fréchet Distance, Link Distance, Voronoi Diagram, Shortest Path Map |
| 3 | Atlas F. Cook, Carola Wenk |
Shortest Path Problems on a Polyhedral Surface.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
Fréchet distance, Voronoi Diagram, Diameter, Polyhedral Surface, Shortest Path Map |
| 3 | Bing Su, Qingchuan Xu, Peng Xiao |
Finding the anti-block vital edge of a shortest path between two nodes.  |
J. Comb. Optim.  |
2008 |
DBLP DOI BibTeX RDF |
Edge failures, Anti-block vital edge, Shortest path |
| 3 | Maria Flavia Monaco, Marcello Sammarra, Luigi Moccia |
Some observations about the extreme points of the Generalized Cardinality-Constrained Shortest Path Problem polytope.  |
Optimization Letters  |
2008 |
DBLP DOI BibTeX RDF |
Basic solutions, Polytopes, Extreme points, Constrained shortest path |
| 3 | Eliécer Gutiérrez, Andrés L. Medaglia |
Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks.  |
Annals OR  |
2008 |
DBLP DOI BibTeX RDF |
Turn prohibitions, Geographic information systems (GIS), Combinatorial optimization, Road networks, Shortest path problem |
| 3 | Martin Holzer, Frank Schulz, Dorothea Wagner |
Engineering multilevel overlay graphs for shortest-path queries.  |
ACM Journal of Experimental Algorithmics  |
2008 |
DBLP DOI BibTeX RDF |
overlay graph, vertex selection, shortest path, preprocessing, hierarchical, Dijkstra's algorithm, multilevel, speed-up technique |
| 3 | Hong Qin, Li Yang |
Detection of Changes in Transitive Associations by Shortest-path Analysis of Protein Interaction Networks Integrated with Gene Expression Profiles.  |
BMEI  |
2008 |
DBLP DOI BibTeX RDF |
shortest path, gene expression, protein interaction network |
| 3 | Mostafa Rezazad, M. Hoseiny Farahabady, Hamid Sarbazi-Azad |
A Deadlock Free Shortest Path Routing Algorithm for WK-Recursive Meshes.  |
ICDCN  |
2008 |
DBLP DOI BibTeX RDF |
WK-recursive, shortest path routing, Deadlock Free Routing Algorithm |
| 3 | Dongming Zhou, Rencan Nie, Dongfeng Zhao |
A New Algorithm for Finding the Shortest Path Tree Using Competitive Pulse Coupled Neural Network.  |
ICIC  |
2008 |
DBLP DOI BibTeX RDF |
Competitive PCNN, shortest path tree, Dijkstra algorithm |
| 3 | Colin Chibaya, Shaun Bangay |
The relationship between emergence of the shortest path and information value using ant-like agents.  |
SAICSIT Conf.  |
2008 |
DBLP DOI BibTeX RDF |
significance level, uncertainty, entropy, shortest path, similarity, correlation, emergence, information, distance |
| 3 | Sudha Rani Kolavali, Shalabh Bhatnagar |
Ant Colony Optimization Algorithms for Shortest Path Problems.  |
NET-COOP  |
2008 |
DBLP DOI BibTeX RDF |
multi-stage shortest path problem, Ant colony optimization, stochastic approximation |
| 3 | K. Ahmed, M. S. Munir, A. S. M. Shihavuddin, M. A. Hoque, K. K. Islam |
Towards Autonomous Robot Operation: Path Map Generation of an Unknown Area by a New Trapezoidal Approximation Method Using a Self Guided Vehicle and Shortest Path Calculation by a Proposed SRS Algorithm.  |
PRICAI  |
2008 |
DBLP DOI BibTeX RDF |
Sobel filter, shortest path calculation, Edge detection, Hough transform, map generation |
| 3 | Mir Shahriar Emami, Mohammad Reza Fattahi, Hossein Keshmiri |
Evaluation on Quantum Computation and Classic Parallel Approaches for Finding Estimation of the Length of Shortest Path in a Weighted Graph.  |
ACIS-ICIS  |
2008 |
DBLP DOI BibTeX RDF |
Shortest Path, Quantum Computation, Weighted Graph |
| 3 | Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shimbo |
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances.  |
KDD  |
2008 |
DBLP DOI BibTeX RDF |
biased random walk, commute-time distance, kernel on a graph, resistance distance, shortest path, graph mining |
| 3 | Yevgeny Schreiber, Micha Sharir |
An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions.  |
Discrete & Computational Geometry  |
2008 |
DBLP DOI BibTeX RDF |
Continuous Dijkstra, Polytope surface, Shortest path, Unfolding, Geodesics, Wavefront, Shortest path map |
| 3 | John Hershberger, Subhash Suri, Amit M. Bhosle |
On the difficulty of some shortest path problems.  |
ACM Transactions on Algorithms  |
2007 |
DBLP DOI BibTeX RDF |
k shortest simple paths, replacement path, lower bound, shortest path |
| 3 | Gábor Rétvári, József Bíró, Tibor Cinkler |
On shortest path representation.  |
IEEE/ACM Trans. Netw.  |
2007 |
DBLP DOI BibTeX RDF |
linear programming, traffic engineering, shortest path routing |
| 3 | Edward P. F. Chan, Heechul Lim |
Optimization and evaluation of shortest path queries.  |
VLDB J.  |
2007 |
DBLP DOI BibTeX RDF |
Shortest path queries, Route queries, Query evaluation and optimization, Graph pruning, Disk-based algorithms, Graph algorithms |
| 3 | Chenglei Yang, Meng Qi, Jiaye Wang, Xiaoting Wang, Xiangxu Meng |
Shortest Path Queries in a Simple Polygon for 3D Virtual Museum.  |
ICCSA  |
2007 |
DBLP DOI BibTeX RDF |
Shortest Path, Voronoi Diagram, Virtual Museum |
| 3 | Yevgeny Schreiber |
Shortest paths on realistic polyhedra.  |
Symposium on Computational Geometry  |
2007 |
DBLP DOI BibTeX RDF |
continuous Dijkstra, realistic, shortest path, terrain, wavefront, polyhedral surface, shortest path map |
| 3 | Binwu Zhang, Jianzhong Zhang 0001, Liqun Qi |
The shortest path improvement problems under Hamming distance.  |
J. Comb. Optim.  |
2006 |
DBLP DOI BibTeX RDF |
NP-hard, Hamming distance, Shortest path problem |
| 3 | Xavier Gandibleux, Frédéric Beugnies, Sabine Randriamasy |
Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function.  |
4OR  |
2006 |
DBLP DOI BibTeX RDF |
shortest path problem, labelling algorithm, Multi-objective combinatorial optimization |
| 3 | Anish Arora, Hongwei Zhang |
LSRP: local stabilization in shortest path routing.  |
IEEE/ACM Trans. Netw.  |
2006 |
DBLP DOI BibTeX RDF |
containment region, local stabilization, perturbation size, range of contamination, shortest path routing |
| 3 | Tetz C. Huang |
An efficient fault-containing self-stabilizing algorithm for the shortest path problem.  |
Distributed Computing  |
2006 |
DBLP DOI BibTeX RDF |
Single-fault situation, Stabilization time, Shortest path problem, Fault-containment, Self-stabilizing algorithm |
| 3 | Feng Lu, Poh-Chin Lai |
A Shortest Path Algorithm Based on Limited Search Heuristics.  |
CSR  |
2006 |
DBLP DOI BibTeX RDF |
heuristic, road network, shortest path algorithm |
| 3 | Mitsuo Gen, Lin Lin |
A new approach for shortest path routing problem by random key-based GA.  |
GECCO  |
2006 |
DBLP DOI BibTeX RDF |
random key-based genetic algorithm, shortest path routing |
| 3 | Yinfeng Xu, Huahai Yan |
Real Time Critical Edge of the Shortest Path in Transportation Networks.  |
TAMC  |
2006 |
DBLP DOI BibTeX RDF |
Real Time Critical Edge, The Shortest Path, Algorithm, Transportation Networks |
| 3 | Zhenyu Wang, Oscar Che, Lijuan Chen, Andrew Lim |
An Efficient Shortest Path Computation System for Real Road Networks.  |
IEA/AIE  |
2006 |
DBLP DOI BibTeX RDF |
shortest path computation, hierarchical network structure, decision support, systems for real life applications |
| 3 | Fajie Li, Reinhard Klette |
Finding the Shortest Path Between Two Points in a Simple Polygon by Applying a Rubberband Algorithm.  |
PSIVT  |
2006 |
DBLP DOI BibTeX RDF |
rubberband algorithm, computational geometry, digital geometry, simple polygon, Euclidean shortest path |
| 3 | Yevgeny Schreiber, Micha Sharir |
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions.  |
Symposium on Computational Geometry  |
2006 |
DBLP DOI BibTeX RDF |
continuous Dijkstra, polytope surface, shortest path, unfolding, geodesics, wavefront, shortest path map |
| 3 | Roberto Montemanni, Luca Maria Gambardella |
The robust shortest path problem with interval data via Benders decomposition.  |
4OR  |
2005 |
DBLP DOI BibTeX RDF |
robust optimization, Shortest path problem, Benders decomposition, interval data |
| 3 | Martin Holzer, Frank Schulz, Dorothea Wagner, Thomas Willhalm |
Combining speed-up techniques for shortest-path computations.  |
ACM Journal of Experimental Algorithmics  |
2005 |
DBLP DOI BibTeX RDF |
Shortest path, combination, speed-up, Dijkstra's algorithm |
| 3 | Dorothea Wagner, Thomas Willhalm, Christos D. Zaroliagis |
Geometric containers for efficient shortest-path computation.  |
ACM Journal of Experimental Algorithmics  |
2005 |
DBLP DOI BibTeX RDF |
geometric container, shortest path, graph algorithms, Dijkstra's algorithm, traffic network, Data structures and algorithms |
| 3 | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack.  |
ESA  |
2005 |
DBLP DOI BibTeX RDF |
min-max regret, mi-nimum spanning tree, approximation, shortest path, knapsack, min-max, fptas |
| 3 | Youngseok Lee, Biswanath Mukherjee |
A Traffic Engineering-Aware Shortest-Path Routing Algorithm in IP Networks.  |
NETWORKING  |
2004 |
DBLP DOI BibTeX RDF |
Simulations, Optimization, IP, Traffic engineering, ILP, Shortest-path routing |
| 3 | Paolo Penna, Carmine Ventre |
Energy-efficient broadcasting in ad-hoc networks: combining MSTs with shortest-path trees.  |
PE-WASUN  |
2004 |
DBLP DOI BibTeX RDF |
light approximate shortest-path trees, wireless ad hoc networks, energy consumption, multicast trees |
| 3 | Cees Duin |
A Branch-Checking Algorithm for All-Pairs Shortest Paths.  |
Algorithmica  |
2004 |
DBLP DOI BibTeX RDF |
Dynamic programming, Shortest path, Shortest path tree |
| 3 | Guozhen Tan, Xiaojun Han, Wen Gao |
Network-Tree Model and Shortest Path Algorithm.  |
International Conference on Computational Science  |
2003 |
DBLP DOI BibTeX RDF |
nNetwork-tree model, route optimization algorithm, large-scale network, shortest path algorithm |
| 3 | Tor Skeie, Olav Lysne, Ingebjørg Theiss |
Layered Shortest Path (LASH) Routing in Irregular System Area Networks. (PDF / PS)  |
IPDPS  |
2002 |
DBLP DOI BibTeX RDF |
shortest path, Network routing, virtual channels, irregular topologies, deadlock freedom |
| 3 | Nasir Shaikh-Husin, Mohamed Khalil Hani, Teoh Giap Seng |
Implementation of Recurrent Neural Network Algorithm for Shortest Path Calculation in Network Routing. (PDF / PS)  |
ISPAN  |
2002 |
DBLP DOI BibTeX RDF |
network routing, hardware implementation, Shortest path algorithm |
| 3 | Sungwon Jung, Sakti Pramanik |
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps.  |
IEEE Trans. Knowl. Data Eng.  |
2002 |
DBLP DOI BibTeX RDF |
digital road maps, parallel shortest path computation, HiTi graph model, Shortest Path, grid graphs |
| 3 | Takashi Kanai, Hiromasa Suzuki |
Approximate Shortest Path on Polyhedral Surface Based on Selective Refinement of the Discrete Graph and Its Applications. (PDF / PS)  |
GMP  |
2000 |
DBLP DOI BibTeX RDF |
computational geometry, geometric modeling, shortest path, Dijkstra's algorithm, polyhedral surface |
| 3 | Ketan Mulmuley, Pradyut Shah |
A Lower Bound for the Shortest Path Problem. (PDF / PS)  |
IEEE Conference on Computational Complexity  |
2000 |
DBLP DOI BibTeX RDF |
parallel, lower bound, shortest path problem |
| 3 | Roberto de Alencar Lotufo, Alexandre X. Falcão, Francisco A. Zampirolli |
Fast Euclidean Distance Transform using a Graph-Search Algorithm. (PDF / PS)  |
SIBGRAPI  |
2000 |
DBLP DOI BibTeX RDF |
Fast Euclidean distance transform, shortest path forest problem, shortest path graph-search, image processing, tree searching, sequential algorithms |
| 3 | Shan Zhu, Garng M. Huang |
A New Parallel and Distributed Shortest Path Algorithm for Hierarchically Clustered Data Networks.  |
IEEE Trans. Parallel Distrib. Syst.  |
1998 |
DBLP DOI BibTeX RDF |
parallel processing, distributed computation, Shortest path, hierarchical network, data network |
| 3 | Ming-Yang Su, Gen-Huey Chen, Dyi-Rong Duh |
A Shortest-Path Routing Algorithm for Incomplete WK-Recursive Networks.  |
IEEE Trans. Parallel Distrib. Syst.  |
1997 |
DBLP DOI BibTeX RDF |
incomplete WK-recursive network, multistage graph representation, shortest-path routing algorithm, routing, Graph-theoretic interconnection network, WK-recursive network |
| 3 | Chien-Ping Chang, Ting-Yi Sung, Lih-Hsing Hsu |
A new shortest path routing algorithm and embedding cycles of crossed cube.  |
ISPAN  |
1997 |
DBLP DOI BibTeX RDF |
embedding cycles, CQ/sub n/, n-dimensional crossed cube, pancyclic network, hypercubes, hypercube networks, shortest path routing, crossed cube |
| 3 | Xuedong Jiang, Tao Yang |
Heuristic algorithms for path selection in private ATM networks.  |
ICCCN  |
1997 |
DBLP DOI BibTeX RDF |
private ATM networks, minimum hop path, end-to-end delay requirement, maximum load level, unconstrained shortest path problem, randomly generated networks, call blocking ratio, link metric, performance, asynchronous transfer mode, probability, call admission control, heuristic algorithms, network routing, NP-complete problem, simulation study, shortest path problem, path selection, multiple constraints |
| 3 | Adam Kapralski |
Fast massively parallel algorithms for shortest path within planar figures.  |
The Visual Computer  |
1996 |
DBLP DOI BibTeX RDF |
Depth search machines, n -CCS, Near edge, Parallel algorithms, Distributed algorithms, Shortest path |
| 3 | Hui-Ling Huang, Gen-Huey Chen |
Shortest-path routing algorithm and topological properties for two-level hypernet networks.  |
ISPAN  |
1996 |
DBLP DOI BibTeX RDF |
hypernet, recursively scalable networks, parallel architectures, connectivity, multiprocessor interconnection networks, embedding, diameter, shortest-path routing, topological properties |
| 2 | Jean Cousty, Gilles Bertrand, Laurent Najman, Michel Couprie |
Watershed Cuts: Thinnings, Shortest Path Forests, and Topological Watersheds.  |
IEEE Trans. Pattern Anal. Mach. Intell.  |
2010 |
DBLP DOI BibTeX RDF |
minimum spanning forest, shortest path forest, connection value, image segmentation, thinning, Watershed |
| 2 | Yangeng Wen, Weihua Zang, Chen Li |
A Novel Shortest Path Method Based on Heuristic Algorithm.  |
MVHI  |
2010 |
DBLP DOI BibTeX RDF |
heuristic strategy, the dynamic direction restricted algorithm, shortest path, Dijkstra algorithm |
| 2 | Sung-Hyun Shin, Sang-Chul Lee, Sang-Wook Kim, Junghoon Lee, Eul Gyu Im |
Efficient shortest path finding of k-nearest neighbor objects in road network databases.  |
SAC  |
2010 |
DBLP DOI BibTeX RDF |
shortest path, road network, k-nearest neighbor query |
| 2 | Yusuke Sakumoto, Hiroyuki Ohsaki, Makoto Imase |
On the Effectiveness of Thorup's Shortest Path Algorithm for Large-Scale Network Simulation.  |
SAINT  |
2010 |
DBLP DOI BibTeX RDF |
single-souce shortest-path problem, large-scale network simulation, thorup's algorithm, dijkstra's algorithm |
| 2 | Jayant Kumar, Wael Abd-Almageed, Le Kang, David S. Doermann |
Handwritten Arabic text line segmentation using affinity propagation.  |
Document Analysis Systems  |
2010 |
DBLP DOI BibTeX RDF |
Arabic documents, Dijkstra's shortest path algorithm, handwritten documents, text line segmentation, clustering, Arabic, breadth-first search, line detection, affinity propagation |
| 2 | Yi-Ju Ho, Jing-Sin Liu |
Simulated annealing based algorithm for smooth robot path planning with different kinematic constraints.  |
SAC  |
2010 |
DBLP DOI BibTeX RDF |
curvature constraint, smooth path planning, optimization, simulated annealing, shortest path, Voronoi diagram, Bezier curve |
| 2 | Atish Das Sarma, Sreenivas Gollapudi, Marc Najork, Rina Panigrahy |
A sketch-based distance oracle for web-scale graphs.  |
WSDM  |
2010 |
DBLP DOI BibTeX RDF |
algorithms, embedding, shortest path, sketching, distance computation |
| 2 | Edward P. F. Chan, Yaya Yang |
Shortest Path Tree Computation in Dynamic Graphs.  |
IEEE Trans. Computers  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Hao-Ping Hung, Ming-Syan Chen |
On designing a shortest-path-based cache replacement in a transcoding proxy.  |
Multimedia Syst.  |
2009 |
DBLP DOI BibTeX RDF |
Cache replacement, Transcoding proxy |
| 2 | Paola Festa |
Shortest Path Tree Algorithms.  |
Encyclopedia of Optimization  |
2009 |
DBLP DOI BibTeX RDF |
Auction technique, Combinatorial optimization, Network optimization, Shortest path problem |
| 2 | Ioannis P. Androulakis |
Dynamic Programming: Stochastic Shortest Path Problems.  |
Encyclopedia of Optimization  |
2009 |
DBLP DOI BibTeX RDF |
Stochastic shortest path, Dynamic programming, Infinite horizon problems |
| 2 | Christina Büsing |
The Exact Subgraph Recoverable Robust Shortest Path Problem.  |
Robust and Online Large-Scale Optimization  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Dariusz Król, Lukasz Popiela |
Modelling Shortest Path Search Techniques by Colonies of Cooperating Agents.  |
ICCCI  |
2009 |
DBLP DOI BibTeX RDF |
nature-inspired networking, multi-agent system, swarm intelligence |
| 2 | Shinichi Honiden, Michael E. Houle, Christian Sommer, Martin Wolff |
Approximate Shortest Path Queries in Graphs Using Voronoi Duals.  |
ISVD  |
2009 |
DBLP DOI BibTeX RDF |
distance oracle, graph Voronoi diagram, approximation, shortest path |
| 2 | Renshen Wang, Nan-Chi Chou, Bill Salefski, Chung-Kuan Cheng |
Low power gated bus synthesis using shortest-path Steiner graph for system-on-chip communications.  |
DAC  |
2009 |
DBLP DOI BibTeX RDF |
Steiner graph, gated bus, power efficiency |
| 2 | Reinhard Bauer, Dorothea Wagner |
Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study.  |
SEA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Salman Yussof, Rina Azlin Razali, Ong Hang See, Azimah Abdul Ghapar, Marina Md. Din |
A Coarse-Grained Parallel Genetic Algorithm with Migration for Shortest Path Routing Problem.  |
HPCC  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Chiun-Chieh Hsu, Da-Ren Chen, Hua-Yuan Ding |
An Efficient Algorithm for the Shortest Path Problem with Forbidden Paths.  |
ICA3PP  |
2009 |
DBLP DOI BibTeX RDF |
Forbidden paths, Shortest paths, Network flows, Labeling algorithm |
| 2 | K. Subramani, Kamesh Madduri |
Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem.  |
COCOA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan |
A Shortest Path-Based Approach to the Multileaf Collimator Sequencing Problem.  |
CPAIOR  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Adam Meyerson, Brian Tagiku |
Minimizing Average Shortest Path Distances via Shortcut Edge Addition.  |
APPROX-RANDOM  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Woo-Jin Seo, Seung Ho Ok, Jin-Ho Ahn, Sungho Kang, Byung In Moon |
An Efficient Hardware Architecture of the A-star Algorithm for the Shortest Path Search Engine.  |
NCM  |
2009 |
DBLP DOI BibTeX RDF |
shortest-path search algorithm, A-star algorithm, sorting, priority queue, shift register |
| 2 | Silvana Petruseva |
Forward Chaining Algorithm for Solving the Shortest Path Problem in Arbitrary Deterministic Environment in Linear Time - Applied for the Tower of Hanoi Problem.  |
KI  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Christian Horoba, Dirk Sudholt |
Running Time Analysis of ACO Systems for Shortest Path Problems.  |
SLS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Dafei Yin |
A scalable heuristic for evacuation planning in large road network.  |
GIS-IWCTS  |
2009 |
DBLP DOI BibTeX RDF |
CCRP, shortest path, evacuation planning |
| 2 | Milos Blagojevic, Majid Nabi, Teun Hendriks, Twan Basten, Marc Geilen |
Fast simulation methods to predict wireless sensor network performance.  |
PE-WASUN  |
2009 |
DBLP DOI BibTeX RDF |
probabilistic abstraction, simulation, wireless sensor networks, performance evaluation, shortest path, monte carlo, system modeling |
| 2 | Shi-Qing Xin, Guo-Jin Wang |
Improving Chen and Han's algorithm on the discrete geodesic problem.  |
ACM Trans. Graph.  |
2009 |
DBLP DOI BibTeX RDF |
computational geometry, shortest path problems, Design and analysis of algorithms |
| 2 | Prasad Chebolu, Alan M. Frieze, Páll Melsted, Gregory B. Sorkin |
Average-Case Analyses of Vickrey Costs.  |
APPROX-RANDOM  |
2009 |
DBLP DOI BibTeX RDF |
VCG auction, Random Assignment Problem, shortest path, minimum spanning tree, random graph, Average-case analysis, MST |
| 2 | Andree Große, Kai Rothaus, Xiaoyi Jiang |
Detection of Non-convex Objects by Dynamic Programming.  |
CAIP  |
2009 |
DBLP DOI BibTeX RDF |
Rack, Dynamic Programming, Shortest Path, Contour Detection |
| 2 | Zonghua Liu, Ming Tang, Pak Ming Hui |
Adaptive Routing Approaches of Controlling Traffic Congestion in Internet.  |
Complex  |
2009 |
DBLP DOI BibTeX RDF |
traffic in internet, shortest path, self-adjusting, traffic congestion, routing strategies |
| 2 | Paula Tarrío, Giuseppe Valenzise, Godwin Shen, Antonio Ortega |
Distributed Network Configuration for Wavelet-Based Compression in Sensor Networks.  |
GSN  |
2009 |
DBLP DOI BibTeX RDF |
In-network compression, wavelet lifting, distributed routing algorithms, collection tree protocol, shortest path tree |
| 2 | Pedro J. Martín, Roberto Torres, Antonio Gavilanes |
CUDA Solutions for the SSSP Problem.  |
ICCS  |
2009 |
DBLP DOI BibTeX RDF |
GPU, CUDA, Shortest path algorithms |
| 2 | Peng Xiao, Yinfeng Xu, Bing Su |
Finding an anti-risk path between two nodes in undirected graphs.  |
J. Comb. Optim.  |
2009 |
DBLP DOI BibTeX RDF |
Most vital real time edge, Anti-risk path, Shortest path, Shortest path tree |
| 2 | George Tsaggouris, Christos D. Zaroliagis |
Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-Linear Objectives with Applications.  |
Theory Comput. Syst.  |
2009 |
DBLP DOI BibTeX RDF |
Multiobjective shortes path, Non-linear objectives, Multiple constrained (optimal) path, Non-additive shortest path, Qos-aware multicommodity flow, Multiobjective optimization, FPTAS |
| 2 | Yijie Han |
An O ( n 3(log log n /log n )5/4) Time Algorithm for All Pairs Shortest Path.  |
Algorithmica  |
2008 |
DBLP DOI BibTeX RDF |
Algorithms, Complexity, Shortest path, Graph algorithms |
| 2 | Reuven Cohen, Gabi Nakibly |
On the computational complexity and effectiveness of N-hub shortest-path routing.  |
IEEE/ACM Trans. Netw.  |
2008 |
DBLP DOI BibTeX RDF |
routing, load balancing |
| 2 | Hua Guo, Anil Maheshwari, Jörg-Rüdiger Sack |
Shortest Path Queries in Polygonal Domains.  |
AAIM  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Christopher L. Barrett, Keith R. Bisset, Martin Holzer, Goran Konjevod, Madhav V. Marathe, Dorothea Wagner |
Engineering Label-Constrained Shortest-Path Algorithms.  |
AAIM  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Matheus Giovanni Pires, Ivan Nunes da Silva, Fabiana Cristina Bertoni |
Solving Shortest Path Problem Using Hopfield Networks and Genetic Algorithms.  |
HIS  |
2008 |
DBLP DOI BibTeX RDF |
genetic algorithm, dynamic programming, shortest path problem, Hopfield network |
| 2 | Charles B. Ward, Nathan M. Wiegand, Phillip G. Bradford |
A Distributed Context-Free Language Constrained Shortest Path Algorithm.  |
ICPP  |
2008 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 2435 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|