Stem shortest$ (all stems)

104 papers:

STOC-2015-AggarwalDRS #problem #using

Solving the Shortest Vector Problem in 2n Time Using Discrete Gaussian Sampling: Extended Abstract (DA, DD, OR, NSD), pp. 733–742.

ICALP-v1-2015-MouawadNPR #configuration management

Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (AEM, NN, VP, VR), pp. 985–996.

ICEIS-v1-2015-FuD #graph #named #scalability #social

ROBE — Knitting a Tight Hub for Shortest Path Discovery in Large Social Graphs (LF, JD), pp. 97–107.

SAC-2015-GoldnerVSG #2d #algorithm

A shortest path algorithm for 2D seismic horizon tracking (ELG, CNV, PMS, MG), pp. 80–85.

VMCAI-2015-RandourRS #probability #problem

Variations on the Stochastic Shortest Path Problem (MR, JFR, OS), pp. 1–18.

HT-2014-QuerciaSA #recommendation

The shortest path to happiness: recommending beautiful, quiet, and happy routes in the city (DQ, RS, LMA), pp. 116–125.

STOC-2014-ChengJ

Shortest paths on polyhedral surfaces and terrains (SWC, JJ), pp. 373–382.

STOC-2014-HenzingerKN #algorithm #graph #reachability

Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs (MH, SK, DN), pp. 674–683.

STOC-2014-Nanongkai #algorithm #approximate #distributed

Distributed approximation algorithms for weighted shortest paths (DN), pp. 565–573.

STOC-2014-Williams14a #complexity #performance

Faster all-pairs shortest paths via circuit complexity (RW), pp. 664–673.

ICALP-v1-2014-BjorklundH #polynomial

Shortest Two Disjoint Paths in Polynomial Time (AB, TH), pp. 211–222.

ICPR-2014-LandgrenOH #image #segmentation #using

A Measure of Septum Shape Using Shortest Path Segmentation in Echocardiographic Images of LVAD Patients (ML, NCO, AH), pp. 3398–3403.

CASE-2013-HoC #contest #design #game studies

Stackelberg game formulation of prize competition design for seeking shortest path solutions (TYH, SCC), pp. 374–379.

SIGMOD-2013-AkibaIY #distance #network #performance #query #scalability

Fast exact shortest-path distance queries on large networks by pruned landmark labeling (TA, YI, YY), pp. 349–360.

SIGMOD-2013-ZhuMXLTZ #distance #network #query #theory and practice #towards

Shortest path and distance queries on road networks: towards bridging theory and practice (ADZ, HM, XX, SL, YT, SZ), pp. 857–868.

VLDB-2014-KaulWYJ13

Finding Shortest Paths on Terrains by Killing Two Birds with One Stone (MK, RCWW, BY, CSJ), pp. 73–84.

STOC-2013-Bernstein #graph #maintenance

Maintaining shortest paths under deletions in weighted directed graphs: [extended abstract] (AB), pp. 725–734.

STOC-2013-EisenstatK #algorithm #graph #linear #multi

Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs (DE, PNK), pp. 735–744.

ICALP-v2-2013-BecchettiBDKM #bound #complexity #convergence #proving

Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds (LB, VB, MD, AK, KM), pp. 472–483.

LATA-2013-AlurKTY #complexity #graph #on the #problem

On the Complexity of Shortest Path Problems on Discounted Cost Graphs (RA, SK, KT, YY), pp. 44–55.

CIKM-2013-LikhyaniB #estimation

Label constrained shortest path estimation (AL, SJB), pp. 1177–1180.

KDD-2013-ZhuXWL #distance #graph #performance #query #scalability

Efficient single-source shortest path and distance queries on large graphs (ADZ, XX, SW, WL), pp. 998–1006.

CASE-2012-WikborgL #multi #petri net #problem #scheduling

Scheduling of Petri nets as a multi-objective shortest path problem (UW, TEL), pp. 212–217.

SIGMOD-2012-ThomsenYJ #effectiveness

Effective caching of shortest paths for location-based services (JRT, MLY, CSJ), pp. 313–324.

VLDB-2012-MouratidisY #information management

Shortest Path Computation with No Information Leakage (KM, MLY), pp. 692–703.

VLDB-2012-WuXDCZZ #distance #evaluation #network #query

Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation (LW, XX, DD, GC, ADZ, SZ), pp. 406–417.

ICML-2012-AlamgirL #distance #graph #nearest neighbour #random

Shortest path distance in random k-nearest neighbor graphs (MA, UvL), p. 163.

SIGMOD-2011-GaoYJZWY #distance #privacy

Neighborhood-privacy protected shortest distance computing in cloud (JG, JXY, RJ, JZ, TW, DY), pp. 409–420.

SIGMOD-2011-LiuW

Finding shortest path on land surface (LL, RCWW), pp. 433–444.

SIGMOD-2011-TaoSP #on the

On k-skip shortest paths (YT, CS, JP), pp. 421–432.

VLDB-2012-GaoJZYJW11 #approach #graph #relational #scalability

Relational Approach for Shortest Path Discovery over Large Graphs (JG, RJ, JZ, JXY, XJ, TW), pp. 358–369.

AFL-2011-PramodK #polynomial #towards #word

Towards Shortest Synchronizing Words in Polynomial Time (VTKP, KVK), pp. 358–367.

CIAA-2011-SkvortsovT #automaton #case study #random #word

Experimental Study of the Shortest Reset Word of Random Automata (ES, ET), pp. 290–298.

ICALP-v1-2011-AbrahamDFGW #algorithm

VC-Dimension and Shortest Path Algorithms (IA, DD, AF, AVG, RFFW), pp. 690–699.

CIKM-2011-TretyakovAGVD #estimation #graph #performance #scalability

Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs (KT, AAC, LGB, JV, MD), pp. 1785–1794.

CASE-2010-LamS #hardware

Accelerating shortest path computations in hardware (SKL, TS), pp. 63–68.

SIGMOD-2010-Wei #graph #named #performance #query

TEDI: efficient shortest path query answering on graphs (FW0), pp. 99–110.

VLDB-2010-KellarisM

Shortest Path Computation on Air Indexes (GK, KM), pp. 747–757.

VLDB-2011-RiceT10 #graph #network #query #strict

Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions (MNR, VJT), pp. 69–80.

CIKM-2010-GaoQJWY #graph #performance

Fast top-k simple shortest paths discovery in graphs (JG, HQ, XJ, TW, DY), pp. 509–518.

CIKM-2010-GubichevBSW #estimation #graph #performance #scalability

Fast and accurate estimation of shortest paths in large graphs (AG, SJB, SS, GW), pp. 499–508.

SAC-2010-ShinLKLI #database #nearest neighbour #network #performance

Efficient shortest path finding of k-nearest neighbor objects in road network databases (SHS, SCL, SWK, JL, EGI), pp. 1661–1665.

SAT-2010-FuhsS #linear #satisfiability #source code #using

Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT (CF, PSK), pp. 71–84.

DAC-2009-WangCSC #graph #power management #synthesis #using

Low power gated bus synthesis using shortest-path Steiner graph for system-on-chip communications (RW, NCC, BS, CKC), pp. 166–171.

STOC-2009-Peikert #problem #worst-case

Public-key cryptosystems from the worst-case shortest vector problem: extended abstract (CP), pp. 333–342.

CIKM-2009-PotamiasBCG #distance #estimation #network #performance #scalability

Fast shortest path distance estimation in large networks (MP, FB, CC, AG), pp. 867–876.

SAC-2009-JeonPC #energy #grid #performance

Sink-oriented dynamic location service for shortest path relay with energy efficient global grid (HJ, KP, HC), pp. 2174–2179.

ICALP-A-2008-RodittyS #fault #sublinear

All-Pairs Shortest Paths with a Sublinear Additive Error (LR, AS), pp. 622–633.

KDD-2008-YenSMS #difference #metric #product line

A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances (LY, MS, AM, MS), pp. 785–793.

SAC-2008-VellosoR #algorithm #analysis

Percolation analyses in a swarm based algorithm for shortest-path finding (BPV, MR), pp. 1861–1865.

STOC-2007-Chan #algorithm #graph

More algorithms for all-pairs shortest paths in weighted graphs (TMC), pp. 590–598.

STOC-2007-HavivR #polynomial #problem

Tensor-based hardness of the shortest vector problem to within almost polynomial factors (IH, OR), pp. 469–477.

ICALP-2007-BlomerN

Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima (JB, SN), pp. 65–77.

DATE-2006-OgrasMLC #architecture #communication #optimisation

Communication architecture optimization: making the shortest path shorter in regular networks-on-chip (ÜYO, RM, HGL, NC), pp. 712–717.

ICPR-v2-2006-GorceP #algorithm #multi #performance

Fast Dichotomic Multiple Search Algorithm for Shortest Cirular Path (MdLG, NP), pp. 403–406.

TACAS-2005-SchuppanB #ltl #model checking

Shortest Counterexamples for Symbolic Model Checking of LTL with Past (VS, AB), pp. 493–509.

STOC-2005-Thorup #worst-case

Worst-case update times for fully-dynamic all-pairs shortest paths (MT), pp. 112–119.

ICALP-2005-JampalaZ

Cache-Oblivious Planar Shortest Paths (HJ, NZ), pp. 563–575.

ICALP-2005-RodittyZ #graph

Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs (LR, UZ), pp. 249–260.

SEKE-2005-HuangC #approximate #case study #distance

A Study of the Approximate Shortest Distance Route for the Construction Walk of Welding Robot (CJH, BKC), pp. 550–555.

SAC-2005-AjiliRE #approach #optimisation

A branch-price-and-propagate approach for optimizing IGP weight setting subject to unique shortest paths (FA, RR, AE), pp. 366–370.

SAC-2005-GuoLLW #linear #problem

The shortest route cut and fill problem in linear topological structure (SG, WL, AL, FW), pp. 409–410.

ICALP-2004-ArgeMT #algorithm #graph #memory management

External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs (LA, UM, LT), pp. 146–157.

STOC-2003-Ajtai #algorithm #approximate #behaviour #worst-case

The worst-case behavior of schnorr’s algorithm approximating the shortest nonzero vector in a lattice (MA), pp. 396–406.

STOC-2003-DemetrescuI #approach

A new approach to dynamic all pairs shortest paths (CD, GFI), pp. 159–166.

STOC-2003-Thorup #constant #integer #problem

Integer priority queues with decrease key in constant time and the single source shortest paths problem (MT), pp. 149–158.

STOC-2002-BaswanaHS #algorithm #maintenance #transitive

Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths (SB, RH, SS), pp. 117–123.

ICALP-2002-DemetrescuI #bound #trade-off

Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths (CD, GFI), pp. 633–643.

ICALP-2002-Pettie #algorithm #graph #performance

A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs (SP), pp. 85–97.

STOC-2001-AjtaiKS #algorithm #problem

A sieve algorithm for the shortest lattice vector problem (MA, RK, DS), pp. 601–610.

ICALP-2001-Tiskin

All-Pairs Shortest Paths Computation in the BSP Model (AT), pp. 178–189.

SAC-2001-BaroneBVM #algorithm #analysis #approximate #problem

An approximation algorithm for the shortest common supersequence problem: an experimental analysis (PB, PB, GDV, GM), pp. 56–60.

STOC-2000-AleksandrovMS #algorithm #approximate #geometry #problem

Approximation algorithms for geometric shortest path problems (LA, AM, JRS), pp. 286–295.

STOC-2000-ChenX #graph #query

Shortest path queries in planar graphs (DZC, JX), pp. 469–478.

ICALP-2000-Hagerup #ram #word

Improved Shortest Paths on the Word RAM (TH), pp. 61–72.

STOC-1999-Kapoor #performance

Efficient Computation of Geodesic Shortest Paths (SK), pp. 770–779.

STOC-1999-Zwick

All Pairs Lightest Shortest Paths (UZ), pp. 61–69.

ICALP-1999-LanthierMS

Shortest Anisotropic Paths on Terrains (ML, AM, JRS), pp. 524–533.

ICALP-1999-Umans #complexity #on the #problem

On the Complexity and Inapproximability of Shortest Implicant Problems (CU), pp. 687–696.

STOC-1998-Ajtai #np-hard #problem #random #reduction

The Shortest Vector Problem in L2 is NP-hard for Randomized Reductions (Extended Abstract) (MA), pp. 10–19.

ICALP-1995-ChaudhuriZ #graph #query

Shortest Path Queries in Digraphs of Small Treewidth (SC, CDZ), pp. 244–255.

STOC-1994-Cohen #approximate

Polylog-time and near-linear work approximation scheme for undirected shortest paths (EC), pp. 16–26.

STOC-1994-KleinRRS #algorithm #graph #performance

Faster shortest-path algorithms for planar graphs (PNK, SR, MRH, SS), pp. 27–37.

ICALP-1994-JiangL #approximate #on the #sequence

On the Approximation of Shortest Common Supersequences and Longest Common Subsequences (TJ, ML), pp. 191–202.

STOC-1993-HershbergerS #matrix #metric

Matrix searching with the shortest path metric (JH, SS), pp. 485–494.

SAC-1993-WangJ #network #segmentation

Segmentation of Merged Characters by Neural Networks and Shortest-Path (JW, JSNJ), pp. 762–769.

HPDC-1993-Pramanick #distributed #problem

Distributed Computing Solutions to the All-Pairs Shortest Path Problem (IP), pp. 196–203.

STOC-1992-KleinS #approximate #parallel #random

A Parallel Randomized Approximation Scheme for Shortest Paths (PNK, SS), pp. 750–758.

STOC-1992-Seidel #on the #problem

On the All-Pairs-Shortest-Path Problem (RS), pp. 745–749.

STOC-1991-BlumJLTY #approximate #linear #string

Linear Approximation of Shortest Superstrings (AB, TJ, ML, JT, MY), pp. 328–336.

ICALP-1991-BhattacharyaT

Computing Shortest Transversals (BKB, GTT), pp. 649–660.

ICALP-1991-DjidjevPZ #graph

Computing Shortest Paths and Distances in Planar Graphs (HD, GEP, CDZ), pp. 327–338.

STOC-1989-Awerbuch #algorithm #distributed

Distributed Shortest Paths Algorithms (Extended Abstract) (BA), pp. 490–500.

ICALP-1989-PapadimitriouY

Shortest Paths Without a Map (CHP, MY), pp. 610–620.

STOC-1987-Clarkson #algorithm #approximate

Approximation Algorithms for Shortest Path Motion Planning (Extended Abstract) (KLC), pp. 56–65.

STOC-1987-Frederickson #approach #graph

A New Approach to All Pairs Shortest Paths in Planar Graphs (Extended Abstract) (GNF), pp. 19–28.

ICALP-1987-EdelsbrunnerRW #testing

Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane (HE, GR, EW), pp. 364–375.

STOC-1985-SuzukiNS #graph #multi

Multicommodity Flows in Planar Undirected Graphs and Shortest Paths (HS, TN, NS), pp. 195–204.

ICALP-1985-LubyR #algorithm #behaviour #bidirectional

A Bidirectional Shortest-Path Algorithm With Good Average-Case Behavior (Preliminary Version) (ML, PR), pp. 394–403.

STOC-1984-SharirS #on the

On Shortest Paths in Polyhedral Spaces (MS, AS), pp. 144–153.

DAC-1981-Ji-GuangK #algorithm

An algorithm for searching shortest path by propagating wave fronts in four quadrants (XJG, TK), pp. 29–36.

STOC-1980-Bloniarz #algorithm

A Shortest-Path Algorithm with Expected Time O(n^2 log n log ^* n) (PAB), pp. 378–384.

GG-1978-CatalanoGM #algebra #framework #problem

Shortest Path Problems and Tree Grammars: An Algebraic Framework (AC, SG, UM), pp. 167–179.

STOC-1977-YaoAR #bound #problem

An Ω(n² log n) Lower Bound to the Shortest Paths Problem (ACCY, DA, RLR), pp. 11–17.