Complexity of the multiobjective minimum weight minimum stretch spanner problem
From MaRDI portal
Recommendations
Cites work
- A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
- Algorithms – ESA 2004
- An Optimal Synchronizer for the Hypercube
- Approximating Multiobjective Shortest Path in Practice
- Generating Sparse 2-Spanners
- Graph spanners
- scientific article; zbMATH DE number 3694968 (Why is no real title available?)
- scientific article; zbMATH DE number 6737879 (Why is no real title available?)
- Multicriteria Optimization
- NP-completeness of minimum spanner problems
- NP-hardness and fixed-parameter tractability of the minimum spanner problem
- On cardinality of the set of alternatives in discrete many-criterion problems
- On generating all maximal independent sets
- On spanning tree problems with multiple objectives
- On sparse spanners of weighted graphs
- Output-sensitive algorithms for enumerating the extreme nondominated points of multiobjective combinatorial optimization problems
- Spanners in graphs of bounded degree
- The complexity of theorem-proving procedures
- Tree Spanners
Cited in
(1)
This page was built for publication: Complexity of the multiobjective minimum weight minimum stretch spanner problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6616272)