Euclidean prize-collecting Steiner forest (Q2429324)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Euclidean prize-collecting Steiner forest	scientific article

Statements

scholarly article

0 references

Euclidean prize-collecting Steiner forest (English)

0 references

Mohammad Taghi Hajiaghayi

0 references

MohammadHossein Bateni

0 references

0 references

publication date

26 April 2012

0 references

zbMATH Keywords

Steiner forest

0 references

prize-collecting

0 references

Euclidean

0 references

approximation algorithms

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00453-011-9491-8

0 references

Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP

0 references

Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

0 references

The prize collecting traveling salesman problem

0 references

Assignment problem in content distribution networks

0 references

Euclidean Prize-Collecting Steiner Forest

0 references

Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth

0 references

Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth

0 references

The Steiner problem with edge lengths 1 and 2

0 references

Detecting high log-densities

0 references

A note on the prize collecting traveling salesman problem

0 references

A constant-factor approximation algorithm for the \(k\)-MST problem

0 references

Sparsest cuts and concurrent flows in product graphs.

0 references

0 references

A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest

0 references

Edge-Disjoint Paths in Planar Graphs with Constant Congestion

0 references

Multicommodity flow, well-linked terminals, and routing problems

0 references

0 references

Saving an epsilon

0 references

A General Approximation Technique for Constrained Forest Problems

0 references

Embedding tree metrics into low-dimensional Euclidean spaces

0 references

Dial a Ride from k-Forest

0 references

The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema

0 references

Prize-Collecting Steiner Networks via Iterative Rounding

0 references

Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation

0 references

0 references

0 references

Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms

0 references

Product Multicommodity Flow in Wireless Networks

0 references

Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems

0 references

Spanning Trees—Short or Small

0 references

Tighter Bounds for Graph Steiner Tree Approximation

0 references

Approximating the Single-Sink Link-Installation Problem in Network Design

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1007/S00453-011-9491-8

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2429324

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2429324&oldid=39077361"