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

DOI10.1007/S10878-011-9387-1MaRDI QIDQ1928513zbMATH OpenOpenAlexFDO

Authors 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

directed hypergraphembeddingPTAS

Mathematics Subject Classification ID

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

Recommendations

• A polynomial time approximation scheme for embedding a directed hypergraph on a ring
• Algorithmic Applications in Management
• A polynomial time approximation scheme for embedding hypergraph in a weighted cycle
• A polynomial time approximation scheme for embedding hypergraph in a weighted cycle
• A polynomial-time approximation scheme for embedding hypergraph in a cycle
• Improved Approximation Algorithms for Weighted Hypergraph Embedding in a Cycle
• A 2-approximation algorithm for an embedded hypergraph in a weighted cycle
• A polynomial-time algorithm to find a linkless embedding of a graph
• Embedding hypergraph in trees of rings
• Improved approximation algorithms for embedding hyperedges in a cycle

Cites work

• A 2-approximation algorithm for an embedded 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 a directed hypergraph on a ring
• A polynomial time approximation scheme for embedding hypergraph in a weighted cycle
• A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting
• A polynomial-time approximation scheme for embedding hypergraph in a cycle
• Automata, Languages and Programming
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Improved approximation algorithms for embedding hyperedges in a cycle
• Improved Approximation Algorithms for Weighted Hypergraph Embedding in a Cycle
• On minimizing the maximum congestion for weighted hypergraph embedding in a cycle
• On the closest string and substring problems
• The weighted link ring loading problem

Cited in

(3)

• A polynomial time approximation scheme for embedding a directed hypergraph on a ring
• Embedding hypergraph in trees of rings
• Algorithmic Applications in Management

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

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