Approximation algorithms for constructing some required structures in digraphs

DOI10.1016/j.ejor.2013.07.033zbMath1305.90400OpenAlexW2072262874MaRDI QIDQ2255946

Shuai He, Yu Ge, Jianping Li, Junran Lichen

Publication date: 18 February 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.07.033

zbMATH Keywords

digraphcombinatorial optimizationinapproximability(asymptotic) approximation algorithmsstructure construction

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Approximation algorithms for constructing required subgraphs using stock pieces of fixed length

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Steiner tree problem with minimum number of Steiner points and bounded edge-length
• An improved FPTAS for Restricted Shortest Path.
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Primal-Dual-Based Algorithms for a Directed Network Design Problem
• Set connectivity problems in undirected graphs and the directed steiner network problem
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• Approximation Algorithms for Several Graph Augmentation Problems
• Approximation Schemes for the Restricted Shortest Path Problem
• Approximations for Steiner trees with minimum number of Steiner points

This page was built for publication: Approximation algorithms for constructing some required structures in digraphs