scientific article; zbMATH DE number 1305417
From MaRDI portal
Publication:4252299
zbMATH Open0974.68156MaRDI QIDQ4252299FDOQ4252299
Authors: Artur Czumaj, Andrzej Lingas 
Publication date: 18 December 2001
Title of this publication is not available (Why is that?)
Recommendations
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cited In (23)
- Approximating minimum-cost graph problems with spanning tree edges
- On PTAS for the geometric maximum connected \(k\)-factor problem
- Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs
- Strongly connected spanning subgraph for almost symmetric networks
- Approximation schemes for capacitated geometric network design
- On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
- On \(k\)-connectivity problems with sharpened triangle inequality
- Two-connected spanning subgraphs with at most \(\frac{10}{7}{\mathrm{OPT}}\) edges
- Some problems in distributed computational geometry
- Probabilistic properties of highly connected random geometric graphs
- Correlation clustering and two-edge-connected augmentation for planar graphs
- A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs
- Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph
- An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph
- Title not available (Why is that?)
- Title not available (Why is that?)
- A constant factor approximation for minimum \(\lambda \)-edge-connected \(k\)-subgraph with metric costs
- The minimum spanning strong subdigraph problem is fixed parameter tractable
- The generalized minimum edge-biconnected network problem: efficient neighborhood structures for variable neighborhood search
- A PTAS for three-edge-connected survivable network design in planar graphs
- Approximation Algorithms for Buy-at-Bulk Geometric Network Design
- A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms
- Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252299)
