Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-17572-5_37
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Improved Hardness Results for Profit Maximization Pricing Problems With Unlimited Supply

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Secluded Path via Shortest Path

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Approximation Complexity of Min-Max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Approximation Algorithms for the Shortest Superstring Problem.

English

An Algorithm of Searching for the Shortest Path

2017English

An Improved SPFA Algorithm for Single-Source Shortest Path Problem Using Forward Star Data Structure

International Journal of Managing Information Technology
2014English

A Novel Stackelberg-Bertrand Game Model for Pricing Content Provider

2015English

Shortest Path Refinement for HARP Motion Tracking

2009English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy