Amanote Research

Amanote Research

    RegisterSign In

The Complexity of Restricted Variants of the Stable Paths Problem

Fundamenta Informaticae - Netherlands
doi 10.3233/fi-2010-319
Full Text
Open PDF
Abstract

Available in full text

Categories
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
Date

January 1, 2010

Authors
Kevin DonnellyAssaf KfouryAndrei Lapets
Publisher

IOS Press


Related search

On the Stable Paths Problem

SIAM Journal on Discrete Mathematics
Mathematics
2010English

Complexity Study for the Robust Stable Marriage Problem

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2019English

The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants

English

On the Configuration-Lp of the Restricted Assignment Problem

2017English

The Stable Roommates Problem

Algorithmics of Matching Under Preferences
2013English

The Parameterized Complexity of the Shared Center Problem

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2012English

On the Complexity of the Highway Pricing Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

On the Complexity of the Asymmetric VPN Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

On the Advice Complexity of the Set Cover Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy