A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring

DOI10.1007/s10878-011-9387-1zbMath1261.90077OpenAlexW2040850184MaRDI QIDQ1928513

Jianping Li, Weidong Li, Lusheng Wang

Publication date: 3 January 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-011-9387-1

zbMATH Keywords

embeddingPTASdirected hypergraph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Improved approximation algorithms for embedding hyperedges in a cycle
• The weighted link ring loading problem
• A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting
• On minimizing the maximum congestion for weighted hypergraph embedding in a cycle
• A polynomial time approximation scheme for embedding a directed hypergraph on a ring
• On the closest string and substring problems
• Improved Approximation Algorithms for Weighted Hypergraph Embedding in a Cycle
• A Polynomial Time Approximation Scheme for Embedding Hypergraph in a Weighted Cycle
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• A polynomial-time approximation scheme for embedding hypergraph in a cycle
• Automata, Languages and Programming

This page was built for publication: A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring