On the approximability of path and cycle problems in arc-dependent networks

DOI10.1007/978-3-030-95018-7_23MaRDI QIDQ6102285zbMATH OpenOpenAlexFDO

Authors Piotr Wojciechowski, K. Subramani, Alvaro Velasquez, Matthew Williamson

Publication date 8 May 2023

Published in Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-95018-7_23

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A note on two problems in connexion with graphs
• Color-coding
• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 751135 (Why is no real title available?)
• Kernelization. Theory of parameterized preprocessing
• On finding minimum routes in a network with turn penalties
• On finding shortest paths in arc-dependent networks
• On solving the quadratic shortest path problem
• On the approximability of the maximum common subgraph problem
• Parameterized algorithms
• Some consequences of non-uniform conditions on uniform classes
• Special cases of the quadratic shortest path problem

Cited in

(4)

• On the analysis of optimization problems in arc-dependent networks
• Asymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failures
• Arc-dependent networks: theoretical insights and a computational study
• Efficient reduction for path problems on circular-arc graphs

This page was built for publication: On the approximability of path and cycle problems in arc-dependent networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6102285)