A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring
type: Item
instance of: scholarly article
title: A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring
zbMATH Open document ID: 1261.90077
author: Jianping Li
author: Weidong Li
author: Lusheng Wang
published in: Journal of Combinatorial Optimization
publication date: 2013-01-03T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6121561
zbMATH Keywords: directed hypergraph
zbMATH Keywords: embedding
zbMATH Keywords: PTAS
MaRDI profile type: Publication
full work available at URL: s10878-011-9387-1
OpenAlex ID: W2040850184
cites work: Automata, Languages and Programming
cites work: Improved approximation algorithms for embedding hyperedges in a cycle
cites work: Improved Approximation Algorithms for Weighted Hypergraph Embedding in a Cycle
cites work: A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
cites work: On minimizing the maximum congestion for weighted hypergraph embedding in a cycle
cites work: A polynomial-time approximation scheme for embedding hypergraph in a cycle
cites work: A polynomial time approximation scheme for embedding a directed hypergraph on a ring
cites work: On the closest string and substring problems
cites work: Q4856179
cites work: The weighted link ring loading problem
cites work: A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting
cites work: A Polynomial Time Approximation Scheme for Embedding Hypergraph in a Weighted Cycle
cites work: Q5320444
DOI: 10.1007/S10878-011-9387-1
Recommended article: A polynomial time approximation scheme for embedding a directed hypergraph on a ring
Recommended article: Algorithmic Applications in Management
Recommended article: A polynomial time approximation scheme for embedding hypergraph in a weighted cycle
Recommended article: A Polynomial Time Approximation Scheme for Embedding Hypergraph in a Weighted Cycle
Recommended article: A polynomial-time approximation scheme for embedding hypergraph in a cycle
Recommended article: Improved Approximation Algorithms for Weighted Hypergraph Embedding in a Cycle
Recommended article: Q5320444
Recommended article: A polynomial-time algorithm to find a linkless embedding of a graph
Recommended article: Q3611020
Recommended article: Improved approximation algorithms for embedding hyperedges in a cycle
description: scientific article; zbMATH DE number 6121561