Approximating the Generalized Capacitated Tree-Routing Problem (Q3511374): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-69733-6_61 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1591100598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Linear Programming Models for Global Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximations for the Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for a capacitated network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approximation algorithms for the Steiner tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for capacitated multicast routings in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Capacitated Tree-Routings in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Generalized Capacitated Tree-Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: RNC-approximation algorithms for the steiner problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3874241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An 11/6-approximation algorithm for the network Steiner problem / rank
 
Normal rank

Latest revision as of 12:13, 28 June 2024

scientific article
Language Label Description Also known as
English
Approximating the Generalized Capacitated Tree-Routing Problem
scientific article

    Statements

    Identifiers