Info
Combinatorial Optimization and Applications [[electronic resource] ] : Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009, Proceedings / / edited by Ding-Zhu Du, Xiaodong Hu, Panos M. Pardalos
| Combinatorial Optimization and Applications [[electronic resource] ] : Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009, Proceedings / / edited by Ding-Zhu Du, Xiaodong Hu, Panos M. Pardalos |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XIII, 542 p.) |
| Disciplina | 005.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Computer networks Software engineering Algorithms Computer science—Mathematics Discrete mathematics Programming Techniques Computer Communication Networks Software Engineering Discrete Mathematics in Computer Science |
| ISBN | 3-642-02026-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms for Network Design -- Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service Provision -- A Linear Time Algorithm for Computing the Most Reliable Source on a Tree with Faulty Vertices -- A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines -- A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs -- Bioinformatics -- DNA Library Screening, Pooling Design and Unitary Spaces -- Improved Algorithms for the Gene Team Problem -- Linear Coherent Bi-cluster Discovery via Line Detection and Sample Majority Voting -- Combinatorics and Its Applications -- Generalized Russian Cards Problem -- Computing the Transitive Closure of a Union of Affine Integer Tuple Relations -- Matching Techniques Ride to Rescue OLED Displays -- Computational Geometry -- On Open Rectangle-of-Influence Drawings of Planar Graphs -- An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems -- Variable-Size Rectangle Covering -- On-Line Multiple-Strip Packing -- Game Theory -- A Cost-Sharing Method for the Soft-Capacitated Economic Lot-Sizing Game -- Improved Bounds for Facility Location Games with Fair Cost Allocation -- Graph Algorithms -- Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem -- On Construction of Almost-Ramanujan Graphs -- A 2log2(n)-Approximation Algorithm for Directed Tour Cover -- Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation -- Graph Theory -- Hamiltonian Decomposition of Some Interconnection Networks -- Infinite Family from Each Vertex k-Critical Graph without Any Critical Edge -- A Note on Edge Choosability and Degeneracy of Planar Graphs -- A Sufficient and Necessary Condition for the Forcing Number of a Bipartite Graph Being Equal to the Minimum Number of Trailing Vertices -- On Integrity of Harary Graphs -- A Note on n-Critical Bipartite Graphs and Its Application -- Network Models and Problems -- Real-Time Algorithm Scheme for n-Vehicle Exploration Problem -- Deterministically Estimating Data Stream Frequencies -- Positive Influence Dominating Set in Online Social Networks -- On-line Algorithms -- Optimal Algorithms for the Online Time Series Search Problem -- A Risk-Reward Competitive Analysis for the Newsboy Problem with Range Information -- Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine -- A Note on Online Scheduling for Jobs with Arbitrary Release Times -- Size-Problems -- Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem -- On Disjoint Shortest Paths Routing on the Hypercube -- A New Approach for Rearrangeable Multicast Switching Networks -- Scheduling -- Bicriteria Scheduling on Single-Machine with Inventory Operations -- Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine -- Scheduling with Rejection to Minimize the Makespan -- Scheduling Problems in Cross Docking -- Makespan Minimization with Machine Availability Constraints -- A Mathematical Programming Approach for Online Hierarchical Scheduling -- Recoverable Robust Timetables on Trees -- Roulette Wheel Graph Colouring for Solving Examination Timetabling Problems -- Integrated Production and Delivery Scheduling with Disjoint Windows -- Wireless and Optical Networks -- Fault-Tolerant Routing: k-Inconnected Many-to-One Routing in Wireless Networks -- A Branch-and-Cut Algorithm for the Minimum Energy Symmetric Connectivity Problem in Wireless Networks -- Minimum Energy Broadcast Routing in Ad Hoc and Sensor Networks with Directional Antennas -- Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings -- An Algorithm with Better Approximation Ratio for Multicast Traffic in Unidirectional SONET/WDM Rings. |
| Record Nr. | UNISA-996465526903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial optimization and applications : third international conference, Cocoa 2009, Huangshan, China, June 10-12, 2009: proceedings / / Ding-Zhu Du, Xiaodong Hu, Panos M. Pardalos (eds.)
| Combinatorial optimization and applications : third international conference, Cocoa 2009, Huangshan, China, June 10-12, 2009: proceedings / / Ding-Zhu Du, Xiaodong Hu, Panos M. Pardalos (eds.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2009 |
| Descrizione fisica | 1 online resource (XIII, 542 p.) |
| Disciplina | 005.11 |
| Altri autori (Persone) |
DuDingzhu
HuXiaodong PardalosP. M <1954-> (Panos M.) |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Combinatorial optimization
Mathematical optimization |
| ISBN | 3-642-02026-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms for Network Design -- Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service Provision -- A Linear Time Algorithm for Computing the Most Reliable Source on a Tree with Faulty Vertices -- A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines -- A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs -- Bioinformatics -- DNA Library Screening, Pooling Design and Unitary Spaces -- Improved Algorithms for the Gene Team Problem -- Linear Coherent Bi-cluster Discovery via Line Detection and Sample Majority Voting -- Combinatorics and Its Applications -- Generalized Russian Cards Problem -- Computing the Transitive Closure of a Union of Affine Integer Tuple Relations -- Matching Techniques Ride to Rescue OLED Displays -- Computational Geometry -- On Open Rectangle-of-Influence Drawings of Planar Graphs -- An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems -- Variable-Size Rectangle Covering -- On-Line Multiple-Strip Packing -- Game Theory -- A Cost-Sharing Method for the Soft-Capacitated Economic Lot-Sizing Game -- Improved Bounds for Facility Location Games with Fair Cost Allocation -- Graph Algorithms -- Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem -- On Construction of Almost-Ramanujan Graphs -- A 2log2(n)-Approximation Algorithm for Directed Tour Cover -- Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation -- Graph Theory -- Hamiltonian Decomposition of Some Interconnection Networks -- Infinite Family from Each Vertex k-Critical Graph without Any Critical Edge -- A Note on Edge Choosability and Degeneracy of Planar Graphs -- A Sufficient and Necessary Condition for the Forcing Number of a Bipartite Graph Being Equal to the Minimum Number of Trailing Vertices -- On Integrity of Harary Graphs -- A Note on n-Critical Bipartite Graphs and Its Application -- Network Models and Problems -- Real-Time Algorithm Scheme for n-Vehicle Exploration Problem -- Deterministically Estimating Data Stream Frequencies -- Positive Influence Dominating Set in Online Social Networks -- On-line Algorithms -- Optimal Algorithms for the Online Time Series Search Problem -- A Risk-Reward Competitive Analysis for the Newsboy Problem with Range Information -- Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine -- A Note on Online Scheduling for Jobs with Arbitrary Release Times -- Size-Problems -- Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem -- On Disjoint Shortest Paths Routing on the Hypercube -- A New Approach for Rearrangeable Multicast Switching Networks -- Scheduling -- Bicriteria Scheduling on Single-Machine with Inventory Operations -- Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine -- Scheduling with Rejection to Minimize the Makespan -- Scheduling Problems in Cross Docking -- Makespan Minimization with Machine Availability Constraints -- A Mathematical Programming Approach for Online Hierarchical Scheduling -- Recoverable Robust Timetables on Trees -- Roulette Wheel Graph Colouring for Solving Examination Timetabling Problems -- Integrated Production and Delivery Scheduling with Disjoint Windows -- Wireless and Optical Networks -- Fault-Tolerant Routing: k-Inconnected Many-to-One Routing in Wireless Networks -- A Branch-and-Cut Algorithm for the Minimum Energy Symmetric Connectivity Problem in Wireless Networks -- Minimum Energy Broadcast Routing in Ad Hoc and Sensor Networks with Directional Antennas -- Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings -- An Algorithm with Better Approximation Ratio for Multicast Traffic in Unidirectional SONET/WDM Rings. |
| Altri titoli varianti | COCOA 2008 |
| Record Nr. | UNINA-9910483868103321 |
| Berlin ; ; New York, : Springer, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computing and Combinatorics [[electronic resource] ] : 14th International Conference, COCOON 2008 Dalian, China, June 27-29, 2008, Proceedings / / edited by Xiaodong Hu, Jie Wang
| Computing and Combinatorics [[electronic resource] ] : 14th International Conference, COCOON 2008 Dalian, China, June 27-29, 2008, Proceedings / / edited by Xiaodong Hu, Jie Wang |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XIV, 680 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Computer networks Algorithms Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Computer graphics Programming Techniques Computer Communication Networks Discrete Mathematics in Computer Science Data Science Computer Graphics |
| ISBN | 3-540-69733-0 |
| Classificazione |
DAT 500f
DAT 537f MAT 050f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms and Data Structures -- Efficient Compression of Web Graphs -- Damaged BZip Files Are Difficult to Repair -- Isoperimetric Problem and Meta-fibonacci Sequences -- Algorithmic Game Theory and Online Algorithms -- On the Complexity of Equilibria Problems in Angel-Daemon Games -- Average-Case Competitive Analyses for One-Way Trading -- On the Monotonicity of Weak Searching -- Automata, Languages, Logic, and Computability -- VC Dimension Bounds for Analytic Algebraic Computations -- Resource Bounded Frequency Computations with Three Errors -- A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model -- Smallest Formulas for Parity of 2 k Variables Are Essentially Unique -- Combinatorics Related to Algorithms and Complexity -- Counting Polycubes without the Dimensionality Curse -- Polychromatic Colorings of n-Dimensional Guillotine-Partitions -- The Computational Complexity of Link Building -- Improved Parameterized Algorithms for Weighted 3-Set Packing -- Structural Identifiability in Low-Rank Matrix Factorization -- Complexity of Counting the Optimal Solutions -- Complexity Theory -- The Orbit Problem Is in the GapL Hierarchy -- Quantum Separation of Local Search and Fixed Point Computation -- Multi-party Quantum Communication Complexity with Routed Messages -- Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments -- Approximating Alternative Solutions -- Dimensions of Points in Self-similar Fractals -- Cryptography, Reliability and Security, and Database Theory -- Visual Cryptography on Graphs -- Algebraic Cryptanalysis of CTRU Cryptosystem -- Computational Biology and Bioinformatics – Model -- Detecting Community Structure by Network Vectorization -- Quasi-bicliques: Complexity and Binding Pairs -- Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis -- Genome Halving under DCJ Revisited -- Haplotype Inferring Via Galled-Tree Networks Is NP-Complete -- Computational Biology and Bioinformatics – Algorithms -- Adjacent Swaps on Strings -- Efficient Algorithms for SNP Haplotype Block Selection Problems -- Sequence Alignment Algorithms for Run-Length-Encoded Strings -- A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations -- A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI -- Computational Algebra, Geometry, and Number Theory -- Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance -- On Center Regions and Balls Containing Many Points -- On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees -- New Algorithms for Online Rectangle Filling with k-Lookahead -- Geometric Spanner of Objects under L 1 Distance -- Graph Drawing and Information Visualization -- Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints -- Graph Theory and Algorithms -- A New Characterization of P 6-Free Graphs -- Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction -- Efficient Algorithms for the k Smallest Cuts Enumeration -- Covering Directed Graphs by In-Trees -- On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints -- Probe Ptolemaic Graphs -- Communication Networks and Optimization -- Diagnosability of Two-Matching Composition Networks -- The Iterated Restricted Immediate Snapshot Model -- Finding Frequent Items in a Turnstile Data Stream -- A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constraints -- Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion Cost -- Wireless Network -- Throughput Maximization with Traffic Profile in Wireless Mesh Network -- Joint Topology Control and Power Conservation for Wireless Sensor Networks Using Transmit Power Adjustment -- (6?+??)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs -- Spectrum Bidding in Wireless Networks and Related -- Network Optimization -- (1?+??)-Approximation for Selected-Internal Steiner Minimum Tree -- Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities -- Spreading Messages -- On Some City Guarding Problems -- Optimal Insertion of a Segment Highway in a City Metric -- Approximating the Generalized Capacitated Tree-Routing Problem -- Column Generation Algorithms for the Capacitated m-Ring-Star Problem -- Scheduling Problem -- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine -- A Two-Stage Flexible Flowshop Problem with Deterioration -- A Lower Bound for the On-Line Preemptive Machine Scheduling with ? p Norm -- The Coordination of Two Parallel Machines Scheduling and Batch Deliveries. |
| Record Nr. | UNISA-996465846303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computing and combinatorics : 14th annual international conference, COCOON 2008 Dalian, China, June 27-29, 2008 : proceedings / / Xiaodong Hu, Jie Wang (eds)
| Computing and combinatorics : 14th annual international conference, COCOON 2008 Dalian, China, June 27-29, 2008 : proceedings / / Xiaodong Hu, Jie Wang (eds) |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2008 |
| Descrizione fisica | 1 online resource (XIV, 680 p.) |
| Disciplina | 004.0151 |
| Altri autori (Persone) |
HuXiaodong
WangJie |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Computer science
Combinatorial analysis |
| ISBN | 3-540-69733-0 |
| Classificazione |
DAT 500f
DAT 537f MAT 050f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms and Data Structures -- Efficient Compression of Web Graphs -- Damaged BZip Files Are Difficult to Repair -- Isoperimetric Problem and Meta-fibonacci Sequences -- Algorithmic Game Theory and Online Algorithms -- On the Complexity of Equilibria Problems in Angel-Daemon Games -- Average-Case Competitive Analyses for One-Way Trading -- On the Monotonicity of Weak Searching -- Automata, Languages, Logic, and Computability -- VC Dimension Bounds for Analytic Algebraic Computations -- Resource Bounded Frequency Computations with Three Errors -- A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model -- Smallest Formulas for Parity of 2 k Variables Are Essentially Unique -- Combinatorics Related to Algorithms and Complexity -- Counting Polycubes without the Dimensionality Curse -- Polychromatic Colorings of n-Dimensional Guillotine-Partitions -- The Computational Complexity of Link Building -- Improved Parameterized Algorithms for Weighted 3-Set Packing -- Structural Identifiability in Low-Rank Matrix Factorization -- Complexity of Counting the Optimal Solutions -- Complexity Theory -- The Orbit Problem Is in the GapL Hierarchy -- Quantum Separation of Local Search and Fixed Point Computation -- Multi-party Quantum Communication Complexity with Routed Messages -- Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments -- Approximating Alternative Solutions -- Dimensions of Points in Self-similar Fractals -- Cryptography, Reliability and Security, and Database Theory -- Visual Cryptography on Graphs -- Algebraic Cryptanalysis of CTRU Cryptosystem -- Computational Biology and Bioinformatics – Model -- Detecting Community Structure by Network Vectorization -- Quasi-bicliques: Complexity and Binding Pairs -- Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis -- Genome Halving under DCJ Revisited -- Haplotype Inferring Via Galled-Tree Networks Is NP-Complete -- Computational Biology and Bioinformatics – Algorithms -- Adjacent Swaps on Strings -- Efficient Algorithms for SNP Haplotype Block Selection Problems -- Sequence Alignment Algorithms for Run-Length-Encoded Strings -- A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations -- A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI -- Computational Algebra, Geometry, and Number Theory -- Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance -- On Center Regions and Balls Containing Many Points -- On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees -- New Algorithms for Online Rectangle Filling with k-Lookahead -- Geometric Spanner of Objects under L 1 Distance -- Graph Drawing and Information Visualization -- Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints -- Graph Theory and Algorithms -- A New Characterization of P 6-Free Graphs -- Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction -- Efficient Algorithms for the k Smallest Cuts Enumeration -- Covering Directed Graphs by In-Trees -- On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints -- Probe Ptolemaic Graphs -- Communication Networks and Optimization -- Diagnosability of Two-Matching Composition Networks -- The Iterated Restricted Immediate Snapshot Model -- Finding Frequent Items in a Turnstile Data Stream -- A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constraints -- Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion Cost -- Wireless Network -- Throughput Maximization with Traffic Profile in Wireless Mesh Network -- Joint Topology Control and Power Conservation for Wireless Sensor Networks Using Transmit Power Adjustment -- (6?+??)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs -- Spectrum Bidding in Wireless Networks and Related -- Network Optimization -- (1?+??)-Approximation for Selected-Internal Steiner Minimum Tree -- Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities -- Spreading Messages -- On Some City Guarding Problems -- Optimal Insertion of a Segment Highway in a City Metric -- Approximating the Generalized Capacitated Tree-Routing Problem -- Column Generation Algorithms for the Capacitated m-Ring-Star Problem -- Scheduling Problem -- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine -- A Two-Stage Flexible Flowshop Problem with Deterioration -- A Lower Bound for the On-Line Preemptive Machine Scheduling with ? p Norm -- The Coordination of Two Parallel Machines Scheduling and Batch Deliveries. |
| Altri titoli varianti | COCOON 2008 |
| Record Nr. | UNINA-9910483048903321 |
| Berlin, : Springer, 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Steiner tree problems in computer communication networks [[electronic resource] /] / Dingzhu Du, Xiaodong Hu
| Steiner tree problems in computer communication networks [[electronic resource] /] / Dingzhu Du, Xiaodong Hu |
| Autore | Du Dingzhu |
| Pubbl/distr/stampa | Singapore ; ; Hackensack, NJ, : World Scientific, c2008 |
| Descrizione fisica | 1 online resource (xiii, 359 p. ) : ill |
| Disciplina | 004.6 |
| Altri autori (Persone) | HuXiaodong |
| Soggetto topico |
Steiner systems
Computer networks |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-281-93394-5
9786611933944 981-279-145-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1. Minimax approach and Steiner ratio. 1.1. Minimax approach. 1.2. Steiner ratio in the Euclidean plane. 1.3. Steiner ratios in other metric spaces. 1.4. Discussions -- 2. k-Steiner ratios and better approximation algorithms. 2.1. k-Steiner ratio. 2.2. Approximations better than minimum spanning tree. 2.3. Discussions -- 3. Geometric partitions and polynomial time approximation schemes. 3.1. Guillotine cut for rectangular partition. 3.2. Portals. 3.3. Banyan and Spanner. 3.4. Discussions -- 4. Grade of service Steiner Tree problem. 4.1. GoSST problem in the Euclidean plane. 4.2. Minimum GoSST problem in graphs. 4.3. Discussions -- 5. Steiner Tree problem for minimal Steiner points. 5.1. In the Euclidean plane. 5.2. In the rectilinear plane. 5.3. In metric spaces. 5.4. Discussions -- 6. Bottleneck Steiner tree problem. 6.1. Complexity study. 6.2. Steinerized minimum spanning tree algorithm. 6.3. 3-restricted Steiner Tree algorithm. 6.4. Discussions -- 7. Steiner k-Tree and k-Path routing problems. 7.1. Problem formulation and complexity study. 7.2. Algorithms for k-Path routing problem. 7.3. Algorithms for k-Tree routing problem. 7.4. Discussions -- 8. Steiner Tree coloring problem. 8.1. Maximum tree coloring. 8.2. Minimum tree coloring. 8.3. Discussions -- 9. Steiner Tree scheduling problem. 9.1. Minimum aggregation time. 9.2. Minimum multicast time problem. 9.3. Discussions -- 10. Survivable Steiner network problem. 10.1. Minimum k-connected Steiner networks. 10.2. Minimum weak two-connected Steiner networks. 10.3. Minimum weak three-edge-connected Steiner networks. 10.4. Discussions. |
| Record Nr. | UNINA-9910453538903321 |
Du Dingzhu
|
||
| Singapore ; ; Hackensack, NJ, : World Scientific, c2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Steiner tree problems in computer communication networks [[electronic resource] /] / Dingzhu Du, Xiaodong Hu
| Steiner tree problems in computer communication networks [[electronic resource] /] / Dingzhu Du, Xiaodong Hu |
| Autore | Du Dingzhu |
| Pubbl/distr/stampa | Singapore ; ; Hackensack, NJ, : World Scientific, c2008 |
| Descrizione fisica | 1 online resource (xiii, 359 p. ) : ill |
| Disciplina | 004.6 |
| Altri autori (Persone) | HuXiaodong |
| Soggetto topico |
Steiner systems
Computer networks |
| ISBN |
1-281-93394-5
9786611933944 981-279-145-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1. Minimax approach and Steiner ratio. 1.1. Minimax approach. 1.2. Steiner ratio in the Euclidean plane. 1.3. Steiner ratios in other metric spaces. 1.4. Discussions -- 2. k-Steiner ratios and better approximation algorithms. 2.1. k-Steiner ratio. 2.2. Approximations better than minimum spanning tree. 2.3. Discussions -- 3. Geometric partitions and polynomial time approximation schemes. 3.1. Guillotine cut for rectangular partition. 3.2. Portals. 3.3. Banyan and Spanner. 3.4. Discussions -- 4. Grade of service Steiner Tree problem. 4.1. GoSST problem in the Euclidean plane. 4.2. Minimum GoSST problem in graphs. 4.3. Discussions -- 5. Steiner Tree problem for minimal Steiner points. 5.1. In the Euclidean plane. 5.2. In the rectilinear plane. 5.3. In metric spaces. 5.4. Discussions -- 6. Bottleneck Steiner tree problem. 6.1. Complexity study. 6.2. Steinerized minimum spanning tree algorithm. 6.3. 3-restricted Steiner Tree algorithm. 6.4. Discussions -- 7. Steiner k-Tree and k-Path routing problems. 7.1. Problem formulation and complexity study. 7.2. Algorithms for k-Path routing problem. 7.3. Algorithms for k-Tree routing problem. 7.4. Discussions -- 8. Steiner Tree coloring problem. 8.1. Maximum tree coloring. 8.2. Minimum tree coloring. 8.3. Discussions -- 9. Steiner Tree scheduling problem. 9.1. Minimum aggregation time. 9.2. Minimum multicast time problem. 9.3. Discussions -- 10. Survivable Steiner network problem. 10.1. Minimum k-connected Steiner networks. 10.2. Minimum weak two-connected Steiner networks. 10.3. Minimum weak three-edge-connected Steiner networks. 10.4. Discussions. |
| Record Nr. | UNINA-9910782273603321 |
|
Du Dingzhu
|
||
| Singapore ; ; Hackensack, NJ, : World Scientific, c2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||