Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-31265-6_6
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Calculating Graph Algorithms for Dominance and Shortest Path

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Approximation Algorithms for the Shortest Superstring Problem.

English

The Shortest Path Problem for a Multiple Graph

Modeling and Analysis of Information Systems
2017English

Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

New Approximation Algorithms for Graph Coloring

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1994English

Shortest Path Estimation for Graph Data Using a Relational Technique

International Journal of Database Management Systems
2015English

I/O-Efficient Algorithms for Shortest Path Related Problems

English

A Shortest-Path Graph Kernel for Estimating Gene Product Semantic Similarity

Journal of Biomedical Semantics
Computer NetworksComputer Science ApplicationsHealth InformaticsInformation SystemsCommunications
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy