|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 981 occurrences of 527 keywords
|
|
|
Results
Found 1968 publication records. Showing 1968 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
111 | Surender Baswana, Ramesh Hariharan, Sandeep Sen |
Maintaining all-pairs approximate shortest paths under deletion of edges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, USA., pp. 394-403, 2003, ACM/SIAM, 0-89871-538-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
73 | Jason J. Holdsworth, Siu Man Lui |
GPS-enabled mobiles for learning shortest paths: a pilot study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FDG ![In: Proceedings of the 4th International Conference on Foundations of Digital Games, FDG 2009, Orlando, Florida, USA, April 26-30, 2009, pp. 86-90, 2009, ACM, 978-1-60558-437-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
GPS-enabled mobile phones, mobile learning, problem-based learning, shortest paths algorithm |
73 | Yanghua Xiao, Wentao Wu 0001, Jian Pei, Wei Wang 0009, Zhenying He |
Efficiently indexing shortest paths by exploiting symmetry in graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EDBT ![In: EDBT 2009, 12th International Conference on Extending Database Technology, Saint Petersburg, Russia, March 24-26, 2009, Proceedings, pp. 493-504, 2009, ACM, 978-1-60558-422-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
70 | Joseph S. B. Mitchell, Christos H. Papadimitriou |
The Weighted Region Problem: Finding Shortest Paths Through a Weighted Planar Subdivision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 38(1), pp. 18-73, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
terrain navigation, weighted distance functions, shortest paths, Voronoi diagrams, Dijkstra's algorithm |
68 | Yakir Berchenko, Mina Teicher |
Graph Embedding through Random Walk for Shortest Paths Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAGA ![In: Stochastic Algorithms: Foundations and Applications, 5th International Symposium, SAGA 2009, Sapporo, Japan, October 26-28, 2009. Proceedings, pp. 127-140, 2009, Springer, 978-3-642-04943-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Graph embedding, shortest paths problem |
67 | Gábor Rétvári, József Bíró, Tibor Cinkler |
On shortest path representation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 15(6), pp. 1293-1306, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
linear programming, traffic engineering, shortest path routing |
64 | Gábor Rétvári, József Bíró, Tibor Cinkler |
On Improving the Accuracy of OSPF Traffic Engineering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networking ![In: NETWORKING 2006 - Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, 5th International IFIP-TC6 Networking Conference, Coimbra, Portugal, May 15-19, 2006, Proceedings, pp. 51-62, 2006, Springer, 3-540-34192-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
linear programming, shortest paths, traffic engineering, OSPF |
63 | Hanan Samet, Jagan Sankaranarayanan, Houman Alborzi |
Scalable network distance browsing in spatial databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2008, Vancouver, BC, Canada, June 10-12, 2008, pp. 43-54, 2008, ACM, 978-1-60558-102-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
shortest path quadtree, scalability, nearest neighbor, decoupling, spatial networks |
63 | Michael Elkin |
Computing almost shortest paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 1(2), pp. 283-323, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
almost shortest paths, Graph algorithms, spanners |
62 | Liam Roditty, Asaf Shapira |
All-Pairs Shortest Paths with a Sublinear Additive Error. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 622-633, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
62 | Gábor Rétvári, Róbert Szabó, József Bíró |
On the Representability of Arbitrary Path Sets as Shortest Paths: Theory, Algorithms, and Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NETWORKING ![In: NETWORKING 2004, Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication, Third International IFIP-TC6 Networking Conference, Athens, Greece, May 9-14, 2004, Proceedings, pp. 1180-1191, 2004, Springer, 3-540-21959-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
routing, linear programming, Traffic engineering, OSPF |
62 | John Hershberger 0001, Subhash Suri |
Efficient Computation of Euclidean Shortest Paths in the Plane ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 508-517, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
plane computational geometry, polygonal obstacles, shortest paths, time complexity, Euclidean shortest paths, efficient computation, worst-case time |
62 | Ekkehard Köhler, Rolf H. Möhring, Heiko Schilling |
Acceleration of Shortest Path and Constrained Shortest Path Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WEA ![In: Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings, pp. 126-138, 2005, Springer, 3-540-25920-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
61 | Mikkel Thorup |
Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 46(3), pp. 362-394, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
RAM algorithms, shortest paths |
60 | Davide Bilò, Luciano Gualà, Guido Proietti, Peter Widmayer |
Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WINE ![In: Internet and Network Economics, 4th International Workshop, WINE 2008, Shanghai, China, December 17-20, 2008. Proceedings, pp. 251-262, 2008, Springer, 978-3-540-92184-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Network Pricing Games, Communication Networks, Stackelberg Games, Shortest Paths Tree |
59 | Liam Roditty, Uri Zwick |
On Dynamic Shortest Paths Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings, pp. 580-591, 2004, Springer, 3-540-23025-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
57 | Betsy George, Sangho Kim 0001, Shashi Shekhar |
Spatio-temporal Network Databases and Routing Algorithms: A Summary of Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSTD ![In: Advances in Spatial and Temporal Databases, 10th International Symposium, SSTD 2007, Boston, MA, USA, July 16-18, 2007, Proceedings, pp. 460-477, 2007, Springer, 978-3-540-73539-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
time-aggregated graphs, spatio-temporal data bases, shortest paths |
57 | Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan |
Multi-Dimensional Interval Routing Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WDAG ![In: Distributed Algorithms, 9th International Workshop, WDAG '95, Le Mont-Saint-Michel, France, September 13-15, 1995, Proceedings, pp. 131-144, 1995, Springer, 3-540-60274-7. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Compact Routing Methods, Interval Routing Schemes, Interconnection Networks, Shortest Paths, Dimensions |
57 | Youngseok Lee 0002, Biswanath Mukherjee |
A Traffic Engineering-Aware Shortest-Path Routing Algorithm in IP Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NETWORKING ![In: NETWORKING 2004, Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication, Third International IFIP-TC6 Networking Conference, Athens, Greece, May 9-14, 2004, Proceedings, pp. 1204-1215, 2004, Springer, 3-540-21959-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Simulations, Optimization, IP, Traffic engineering, ILP, Shortest-path routing |
56 | Shigang Chen, Meongchul Song, Sartaj Sahni |
Two techniques for fast computation of constrained shortest paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 16(1), pp. 105-115, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
approximation algorithms, QoS routing, constrained shortest paths |
56 | Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni |
Dynamic Multi-level Overlay Graphs for Shortest Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Sci. ![In: Math. Comput. Sci. 1(4), pp. 709-736, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Shortest paths algorithms, speed-up techniques |
56 | Luciano Gualà, Guido Proietti |
Efficient Truthful Mechanisms for the Single-Source Shortest Paths Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30 - September 2, 2005, Proceedings, pp. 941-951, 2005, Springer, 3-540-28700-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Equilibria in Distributed Systems, Single-Source Shortest Paths Tree, Algorithmic Mechanism Design, Selfish Agents, Truthful Mechanisms |
56 | Camil Demetrescu, Giuseppe F. Italiano |
A new approach to dynamic all pairs shortest paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 51(6), pp. 968-992, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
shortest paths, Dynamic graph algorithms |
56 | Camil Demetrescu, Giuseppe F. Italiano |
A new approach to dynamic all pairs shortest paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 159-166, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
shortest paths, dynamic graph algorithms |
56 | Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerurkar, Jean-Pierre Seifert, Igor E. Shparlinski |
On Routing in Circulant Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 5th Annual International Conference, COCOON '99, Tokyo, Japan, July 26-28, 1999, Proceedings, pp. 360-369, 1999, Springer, 3-540-66200-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Shortest paths, Lattices, Diameter, Loops, Circulant graphs |
54 | Sudip Misra, B. John Oommen |
Stochastic Learning Automata-Based Dynamic Algorithms for the Single Source Shortest Path Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEA/AIE ![In: Innovations in Applied Artificial Intelligence, 17th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, IEA/AIE 2004, Ottawa, Canada, May 17-20, 2004. Proceedings, pp. 239-248, 2004, Springer, 3-540-22007-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Intelligent Systems, Learning Automata, Dynamic Shortest Paths |
54 | Cees Duin |
A Branch-Checking Algorithm for All-Pairs Shortest Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 41(2), pp. 131-145, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Dynamic programming, Shortest path, Shortest path tree |
54 | Micha Sharir, Avikam Baltsan |
On Shortest Paths Amidst Convex Polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, Yorktown Heights, NY, USA, June 2-4, 1986, pp. 193-206, 1986, ACM, 0-89791-194-6. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
54 | M. G. Karunambigai, Parvathi Rangasamy, Krassimir T. Atanassov, N. Palaniappan |
An Intuitionistic Fuzzy Graph Method for Finding the Shortest Paths in Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFSA (2) ![In: Theoretical Advances and Applications of Fuzzy Logic and Soft Computing, Selection of Papers from IFSA 2007, pp. 3-10, 2007, Springer, 978-3-540-72433-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Index Matrix (IM), Intuitionistic Fuzzy Graphs (IFGs), Dynamic programming (DP), Shortest path |
54 | Liam Roditty, Uri Zwick |
Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, pp. 249-260, 2005, Springer, 3-540-27580-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
53 | Matthias Müller-Hannemann, Karsten Weihe |
Pareto Shortest Paths is Often Feasible in Practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAE ![In: Algorithm Engineering, 5th International Workshop, WAE 2001 Aarhus, Denmark, August 28-31, 2001, Proceedings, pp. 185-198, 2001, Springer, 3-540-42500-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
railway networks, shortest paths, Multi-criteria optimization, Pareto set |
52 | Betsy George, Shashi Shekhar |
Time-Aggregated Graphs for Modeling Spatio-temporal Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Data Semantics ![In: Journal on Data Semantics XI, pp. 191-212, 2006, Springer, 978-3-540-92147-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
time-aggregated graphs, spatio-temporal data- bases, location based services, shortest paths |
52 | Ammar W. Mohemmed, Nirod Chandra Sahoo, Tan Kim Geok |
A new particle swarm optimization based algorithm for solving shortest-paths tree problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Congress on Evolutionary Computation ![In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2007, 25-28 September 2007, Singapore, pp. 3221-3225, 2007, IEEE, 978-1-4244-1339-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
52 | Sudip Misra, B. John Oommen |
An Efficient Dynamic Algorithm for Maintaining All-Pairs Shortest Paths in Stochastic Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 55(6), pp. 686-702, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
stochastic graphs, Routing, dynamic, learning automata, all pairs shortest path |
52 | Joseph S. B. Mitchell, Micha Sharir |
New results on shortest paths in three dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 124-133, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
shortest path, NP-hardness, motion planning, terrain |
52 | Víctor M. Jiménez, Andrés Marzal |
A Lazy Version of Eppstein's K Shortest Paths Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WEA ![In: Experimental and Efficient Algorithms, Second International Workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings, pp. 179-190, 2003, Springer, 3-540-40205-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
52 | Surender Baswana, Ramesh Hariharan, Sandeep Sen |
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 117-123, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
BFS tree, decremental, reachability |
52 | Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack |
Approximating Shortest Paths on Weighted Polyhedral Surfaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 30(4), pp. 527-562, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
52 | Jiefeng Cheng, Jeffrey Xu Yu |
On-line exact shortest distance query processing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EDBT ![In: EDBT 2009, 12th International Conference on Extending Database Technology, Saint Petersburg, Russia, March 24-26, 2009, Proceedings, pp. 481-492, 2009, ACM, 978-1-60558-422-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
52 | Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack |
Shortest Anisotropic Paths on Terrains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings, pp. 524-533, 1999, Springer, 3-540-66224-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
aniositropic paths, computational geometry, approximation, shortest path |
51 | Uri Zwick |
All pairs shortest paths using bridging sets and rectangular matrix multiplication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 49(3), pp. 289-317, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
shortest paths, Matrix multiplication |
51 | Uri Zwick |
All Pairs Shortest Paths in Weighted Directed Graphs ¾ Exact and Almost Exact Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Palo Alto, California, USA, pp. 310-319, 1998, IEEE Computer Society, 0-8186-9172-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Bridging sets, Randomized algorithms, Shortest paths, Matrix multiplication |
51 | Michael Elkin, Jian Zhang 0004 |
Efficient algorithms for constructing (1+, varepsilon;, beta)-spanners in the distributed and streaming models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John's, Newfoundland, Canada, July 25-28, 2004, pp. 160-168, 2004, ACM, 1-58113-802-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
almost shortest paths, streaming model, spanner |
51 | Gianlorenzo D'Angelo, Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni |
Partially Dynamic Concurrent Update of Distributed Shortest Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCTA ![In: 2007 International Conference on Computing: Theory and Applications (ICCTA 2007), 5-7 March 2007, Kolkata, India, pp. 32-38, 2007, IEEE Computer Society, 978-0-7695-2770-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
51 | Valerie King |
Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17-18 October, 1999, New York, NY, USA, pp. 81-91, 1999, IEEE Computer Society, 0-7695-0409-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
49 | Edith Cohen |
Polylog-time and near-linear work approximation scheme for undirected shortest paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 47(1), pp. 132-166, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
48 | Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick |
Reachability and distance queries via 2-hop labels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA., pp. 937-946, 2002, ACM/SIAM, 0-89871-513-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
48 | Anna Nepomniaschaya |
Associative Version of the Ramalingam Decremental Algorithm for Dynamic Updating the Single-Sink Shortest-Paths Subgraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PaCT ![In: Parallel Computing Technologies, 10th International Conference, PaCT 2009, Novosibirsk, Russia, August 31-September 4, 2009. Proceedings, pp. 257-268, 2009, Springer, 978-3-642-03274-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Directed weighted graph, subgraph of the shortest paths, decremental algorithm, associative parallel processor, access data by contents, adjacency matrix |
48 | Timothy M. Chan |
All-Pairs Shortest Paths with Real Weights in O ( n 3/log n ) Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 50(2), pp. 236-243, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Shortest paths, Graph algorithms |
48 | Emina I. Milovanovic, Igor Z. Milovanovic, Michael P. Bekakos, I. N. Tselepis |
Computing all-pairs shortest paths on a linear systolic array and hardware realization on a reprogrammable FPGA platform. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 40(1), pp. 49-66, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
FPGA, Parallel computations, Systolic arrays, All-pairs shortest paths, Parallel iterative methods |
48 | Luciano Gualà, Guido Proietti |
Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 49(3), pp. 171-191, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Single-source shortest paths tree, Algorithmic mechanism design, Selfish agents, Truthful mechanisms |
48 | Gayathri Venkataraman, Sartaj Sahni, Srabani Mukhopadhyaya |
A blocked all-pairs shortest-paths algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 8, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
cache, blocking, speedup, all pairs shortest paths |
48 | Mikkel Thorup |
Integer priority queues with decrease key in constant time and the single source shortest paths problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 149-158, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Fibonacci heaps, single source shortest paths, priority queues |
48 | Avi Shoshan, Uri Zwick |
All Pairs Shortest Paths in Undirected Graphs with Integer Weights. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17-18 October, 1999, New York, NY, USA, pp. 605-615, 1999, IEEE Computer Society, 0-7695-0409-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
shortest paths, graph algorithms, matrix multiplication |
48 | Jean-Daniel Boissonnat, André Cérézo, Juliette Leblond |
Shortest paths of bounded curvature in the plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Robotic Syst. ![In: J. Intell. Robotic Syst. 11(1-2), pp. 5-20, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
car-like robots, minimum principle of Pontryagin, optimal control, Motion planning, constrained shortest paths |
48 | Sing-Ban Tien, Cauligi S. Raghavendra |
Algorithms and Bounds for Shortest Paths and Diameter in Faulty Hypercubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 4(6), pp. 713-718, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
n-dimensional hypercube, parallel algorithms, computational complexity, complexity, fault tolerant computing, shortest paths, hypercube networks, diameter, bounds, faulty hypercubes |
47 | Matthias Kirschner, Philipp Schengbier, Tobias Tscheuschner |
Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SEA ![In: Experimental Algorithms, 8th International Symposium, SEA 2009, Dortmund, Germany, June 4-6, 2009. Proceedings, pp. 173-184, 2009, Springer, 978-3-642-02010-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
selfish step algorithm, network congestion games, game theory, shortest paths, Nash equilibria, speed-up techniques |
47 | Jordi Castro 0001 |
A Fast Network Flows Heuristic for Cell Suppression in Positive Tables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Privacy in Statistical Databases ![In: Privacy in Statistical Databases: CASC Project International Workshop, PSD 2004, Barcelona, Spain, June 9-11, 2004. Proceedings, pp. 136-148, 2004, Springer, 3-540-22118-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
cell suppression problem, linear programming, shortest-paths, statistical disclosure control, network optimization |
47 | Yinzhen Li, Ruichun He, Linzhong Liu, Yaohuang Guo |
Genetic Algorithms for Dissimilar Shortest Paths Based on Optimal Fuzzy Dissimilar Measure and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD (1) ![In: Fuzzy Systems and Knowledge Discovery, Second International Conference, FSKD 2005, Changsha, China, August 27-29, 2005, Proceedings, Part I, pp. 312-320, 2005, Springer, 3-540-28312-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
47 | Ran Duan, Seth Pettie |
Bounded-leg distance and reachability oracles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 436-445, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
47 | Yuval Emek, David Peleg, Liam Roditty |
A near-linear time algorithm for computing replacement paths in planar directed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 428-435, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
46 | Meinolf Sellmann |
Cost-Based Filtering for Shorter Path Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2003, 9th International Conference, CP 2003, Kinsale, Ireland, September 29 - October 3, 2003, Proceedings, pp. 694-708, 2003, Springer, 3-540-20202-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
optimization constraints, relaxed consistency, constrained shortest paths, problem reduction |
46 | Fang-Rong Hsu, Yaw-Ling Lin, Yin-Te Tsai |
Parallel Algorithms for Shortest Paths and Related Problems on Trapezoid Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 10th International Symposium, ISAAC '99, Chennai, India, December 16-18, 1999, Proceedings, pp. 173-182, 1999, Springer, 3-540-66916-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
46 | Chiun-Chieh Hsu, Da-Ren Chen, Hua-Yuan Ding |
An Efficient Algorithm for the Shortest Path Problem with Forbidden Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICA3PP ![In: Algorithms and Architectures for Parallel Processing, 9th International Conference, ICA3PP 2009, Taipei, Taiwan, June 8-11, 2009. Proceedings, pp. 638-650, 2009, Springer, 978-3-642-03094-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Forbidden paths, Shortest paths, Network flows, Labeling algorithm |
46 | Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack |
Determining approximate shortest paths on weighted polyhedral surfaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 52(1), pp. 25-53, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
weighted paths, approximation algorithms, computational geometry, shortest path problems, Design and analysis of algorithms, polyhedral surfaces |
46 | Philip N. Klein, Sairam Subramanian |
A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 22(3), pp. 235-249, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Minimum-cost path, Minimum-cost path, Shortest path, Shortest path, Graph algorithm, Graph algorithm, Planar graph, Planar graph, Key words, Dynamic algorithm, Dynamic algorithm |
46 | Eric Ruppert |
Finding the k Shortest Paths in Parallel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997, Proceedings, pp. 475-486, 1997, Springer, 3-540-62616-6. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Topics parallel algorithms, data structures |
45 | Laxmi P. Gewali, Victor Roman |
Generalization of Shortest Path Map. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITNG ![In: Seventh International Conference on Information Technology: New Generations, ITNG 2010, Las Vegas, Nevada, USA, 12-14 April 2010, pp. 296-300, 2010, IEEE Computer Society, 978-0-7695-3984-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
constrained shortest paths map, shortest paths, Path planning |
45 | Shmuel Zaks |
On the Use of Duality and Geometry in Layouts for ATM Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2000, 25th International Symposium, MFCS 2000, Bratislava, Slovakia, August 28 - September 1, 2000, Proceedings, pp. 114-131, 2000, Springer, 3-540-67901-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
44 | Piet Van Mieghem, Huijuan Wang |
The observable part of a network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 17(1), pp. 93-105, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
union of shortest paths, observability, overlay |
44 | Tadao Takaoka |
Partial Solution and Entropy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings, pp. 700-711, 2009, Springer, 978-3-642-03815-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
adaptive sort, minimal mergesort, ascending runs, nearly acyclic graphs, complexity, entropy, shortest paths, minimum spanning trees |
44 | Mikkel Thorup |
Undirected Single Source Shortest Path in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 12-21, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
single source shortest paths problem, algorithmic graph theory, deterministic linear time, hierarchical bucketing, deterministic algorithms, linear time, weighted graph, Dijkstra's algorithm, linear space |
44 | Yevgeny Schreiber, Micha Sharir |
An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 39(1-3), pp. 500-579, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Continuous Dijkstra, Polytope surface, Shortest path, Unfolding, Geodesics, Wavefront, Shortest path map |
44 | Liam Roditty |
On the K-simple shortest paths problem in weighted directed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 920-928, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
44 | Yevgeny Schreiber, Micha Sharir |
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 22nd ACM Symposium on Computational Geometry, Sedona, Arizona, USA, June 5-7, 2006, pp. 30-39, 2006, ACM, 1-59593-340-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
continuous Dijkstra, polytope surface, shortest path, unfolding, geodesics, wavefront, shortest path map |
44 | Víctor M. Jiménez, Andrés Marzal |
Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAE ![In: Algorithm Engineering, 3rd International Workshop, WAE '99, London, UK, July 19-21, 1999, Proceedings, pp. 15-29, 1999, Springer, 3-540-66427-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
44 | Hongchi Shi, Paul D. Gader, Hongzheng Li |
Parallel Mesh Algorithms for Grid Graph Shortest Paths with Application to Separation of Touching Chromosomes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 12(1-2), pp. 69-83, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
chromosome image segmentation, parallel algorithm, feature extraction, shortest path, mesh-connected computer, grid graph |
43 | João L. Sobrinho |
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 10(4), pp. 541-550, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
quality of service, internet, Internet, routing, algebra |
42 | Michele Flammini, Giorgio Gambosi, Sandro Salomone |
Boolean Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WDAG ![In: Distributed Algorithms, 7th International Workshop, WDAG '93, Lausanne, Switzerland, September 27-29, 1993, Proceedings, pp. 219-233, 1993, Springer, 3-540-57271-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
shortest paths representation, Distributed systems, NP-completeness, interval routing, compact routing tables |
42 | Eddie Cheng 0001, Shuhong Gao, Ke Qiu 0001, Zhizhang Shen |
On Disjoint Shortest Paths Routing on the Hypercube. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009. Proceedings, pp. 375-383, 2009, Springer, 978-3-642-02025-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
42 | Nighat Yasmin |
Incremental computation of shortest paths in semi-dynamic graphs using software components. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Southeast Regional Conference ![In: Proceedings of the 44st Annual Southeast Regional Conference, 2006, Melbourne, Florida, USA, March 10-12, 2006, pp. 96-101, 2006, ACM, 1-59593-315-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
semi-dynamic graphs, specification, shortest path, software component, incremental computation |
42 | Rezaul Alam Chowdhury, Vijaya Ramachandran |
External-memory exact and approximate all-pairs shortest-paths in undirected graphs. ![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. 735-744, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
42 | Sergei Bespamyatnikh |
Computing homotopic shortest paths in the plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, USA., pp. 609-617, 2003, ACM/SIAM, 0-89871-538-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
42 | John Hershberger 0001, Subhash Suri, Amit M. Bhosle |
On the Difficulty of Some Shortest Path Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings, pp. 343-354, 2003, Springer, 3-540-00623-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
42 | Matt Duckham, Lars Kulik |
"Simplest" Paths: Automated Route Selection for Navigation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COSIT ![In: Spatial Information Theory. Foundations of Geographic Information Science, International Conference, COSIT 2003, Ittingen, Switzerland, September 24-28, 2003, Proceedings, pp. 169-185, 2003, Springer, 3-540-20148-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
instruction complexity, Navigation, shortest path, wayfinding, route selection |
41 | Kranthi K. Mamidisetty, Minlan Duan, Shivakumar Sastry, P. S. Sastry |
Multipath Dissemination in Regular Mesh Topologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 20(8), pp. 1188-1201, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
41 | Jianxi Fan, Xiaola Lin, Xiaohua Jia |
Optimal Path Embedding in Crossed Cubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 16(12), pp. 1190-1200, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
optimal embedding, interconnection network, graph embedding, Crossed cube, parallel computing system |
41 | Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilfong |
The stable paths problem and interdomain routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 10(2), pp. 232-243, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
path vector protocols, stable routing, BGP, Border Gateway Protocol, interdomain routing, internet routing |
41 | Aaron Bernstein, David R. Karger |
A nearly optimal oracle for avoiding failed vertices and edges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 101-110, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
shortest paths, sensitivity |
41 | Jakob Krarup, Malene Nordlund Rørbech |
LP formulations of the shortest path tree problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 2(4), pp. 259-274, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
visualizing LP-duality, linear programming, Shortest paths |
41 | Sudip Misra, B. John Oommen |
The Pursuit Automaton Approach for Estimating All-Pairs Shortest Paths in Dynamically Changing Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AINA Workshops (1) ![In: 21st International Conference on Advanced Information Networking and Applications (AINA 2007), Workshops Proceedings, Volume 1, May 21-23, 2007, Niagara Falls, Canada, pp. 124-129, 2007, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
41 | Sudip Misra, B. John Oommen |
New Algorithms for Maintaining All-Pairs Shortest Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCC ![In: Proceedings of the 10th IEEE Symposium on Computers and Communications (ISCC 2005), 27-30 June 2005, Murcia, Cartagena, Spain, pp. 116-121, 2005, IEEE Computer Society, 0-7695-2373-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
41 | Jindong Chen, Yijie Han |
Storing Shortest Paths for a Polyhedron. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCI ![In: Advances in Computing and Information - ICCI'91, International Conference on Computing and Information, Ottawa, Canada, May 27-29, 1991, Proceedings, pp. 169-180, 1991, Springer, 3-540-54029-6. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
41 | Kenneth L. Clarkson, Sanjiv Kapoor, Pravin M. Vaidya |
Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n)2) Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Third Annual Symposium on Computational Geometry, Waterloo, Ontario, Canada, June 8-10, 1987, pp. 251-257, 1987, ACM, 0-89791-231-4. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
41 | Andrew Zalesky |
DT-MRI Fiber Tracking: A Shortest Paths Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Medical Imaging ![In: IEEE Trans. Medical Imaging 27(10), pp. 1458-1471, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
41 | Yanzhi Li, Andrew Lim 0001, Hong Ma |
A Hybrid Genetic Algorithm for Solving the Length-Balanced Two Arc-Disjoint Shortest Paths Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEA/AIE ![In: Advances in Applied Artificial Intelligence, 19th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2006, Annecy, France, June 27-30, 2006, Proceedings, pp. 272-281, 2006, Springer, 3-540-35453-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
length-balanced, shortest path, Lagrangian relaxation |
41 | Michael Elkin |
Computing almost shortest paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, PODC 2001, Newport, Rhode Island, USA, August 26-29, 2001, pp. 53-62, 2001, ACM, 1-58113-383-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
40 | Feng Lu 0004, Poh-Chin Lai |
A Shortest Path Algorithm Based on Limited Search Heuristics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, First International Symposium on Computer Science in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings, pp. 487-497, 2006, Springer, 3-540-34166-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
heuristic, road network, shortest path algorithm |
40 | Jérôme Berclaz, François Fleuret, Engin Türetken, Pascal Fua |
Multiple Object Tracking Using K-Shortest Paths Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 33(9), pp. 1806-1819, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
multiobject tracking, linear programming, Data association, K-shortest paths |
40 | Aaron Bernstein |
Fully Dynamic (2 + epsilon) Approximate All-Pairs Shortest Paths with Fast Query and Close to Linear Update Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, pp. 693-702, 2009, IEEE Computer Society, 978-0-7695-3850-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithms, shortest paths, graph algorithms, dynamic algorithms |
Displaying result #1 - #100 of 1968 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|