CORE
COnnecting
REpositories
  • Services overviewExplore all CORE services
  • Access to raw data

    • API
    • Dataset
    • FastSync
  • Content discovery

    • Recommender
    • Discovery
  • OAI identifiers

    • OAI Resolver
  • Managing content

    • Dashboard
  • Bespoke contracts

    • Consultancy services
  • Support us

      MembershipSponsorshipResearch partnership
  • About

    • About us
    • Our mission
    • Team
    • Blog
    • FAQs
    • Contact us
  • Community governance

    • Governance
    • Advisory Board
    • Board of supporters
    • Research network
  • Innovations

    • Our research
    • Labs
oaioai:dspace.lib.ntua.gr:123456789/31279

Constrained shortest path computation

Authors
  1. M Terrovitis
  2. S Bakiras
  3. D Papadias
  4. K Mouratidis
Publication date
1 January 2005
Publisher
Doi

    Abstract

    Abstract is not available.
    • Data Partitioning
    • Exact Algorithm
    • Indexation
    • Optimal Path
    • Search Space
    • Spatial Database
    • Shortest Path
    • Shortest Path Problem
    • Computer Science, Theory & Methods
    • Algorithms
    • Constraint theory
    • Database systems
    • Data-partitioning method
    • Eucledean distance method
    • Spatial databases
    • Sub-optimal method
    • Computational methods
    • Data Partitioning
    • Exact Algorithm
    • Indexation
    • Optimal Path
    • Search Space
    • Spatial Database
    • Shortest Path
    • Shortest Path Problem
    • Computer Science, Theory & Methods
    • Algorithms
    • Constraint theory
    • Database systems
    • Data-partitioning method
    • Eucledean distance method
    • Spatial databases
    • Sub-optimal method
    • Computational methods

    Similar works

    Full text

    thumbnail-image

    DSpace@NTUA (National Technical Univ. of Athens)

    redirect
    oaioai:dspace.lib.ntua.gr:1234567...
    Last time updated on 03/06/2016

    This paper was published in DSpace@NTUA (National Technical Univ. of Athens).

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.

    CORE (COnnecting REpositories) is a not-for-profit service hosted by The Open University supported by CORE Members.

    Product
    • Services
    • Membership
    • Sponsorship
    • Labs
    Organisation
    • About us
    • Governance
    • Team
    • Data providers
    Support
    • Terms
    • FAQs
    • Blog
    • Contact us
    Writing about CORE?

    Discover our research outputs and cite our work.

    Follow us:
    COREAccessibilityCookiesPrivacy