Network construction with ordered constraints

DOI10.4230/LIPICS.FSTTCS.2017.34MaRDI QIDQ5136326zbMATH OpenFDO

Authors

Publication date 25 November 2020

Full work available at URL https://arxiv.org/abs/1702.07292

zbMATH Keywords

network constructionordered connectivity constraintsPQ-treessubgraph connectivity

Mathematics Subject Classification ID

Connectivity (05C40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Recommendations

• Network construction with subgraph connectivity constraints
• Online constrained forest and prize-collecting network design
• Constructing Reliable Communication Networks of Small Weight Online
• Inferring Social Networks from Outbreaks
• scientific article; zbMATH DE number 1444316

Cites work

• A general approach to online network optimization problems
• A threshold of ln n for approximating set cover
• Constructing scalable overlays for pub-sub with many topics
• Equal-need sharing of a network under connectivity constraints
• scientific article; zbMATH DE number 1559563 (Why is no real title available?)
• Inferring Social Networks from Outbreaks
• Learning a hidden graph using \(O(\log n)\)queries per edge
• Learning a Hidden Matching
• Learning a Hidden Subgraph
• Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
• Network construction with subgraph connectivity constraints
• Online and Stochastic Survivable Network Design
• Optimally learning social networks with activations and suppressions
• Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• The clustering matroid and the optimal clustering tree
• The complete optimal stars-clustering-tree problem
• The Design of Competitive Online Algorithms via a Primal—Dual Approach
• The online set cover problem

Cited in

(4)

• Network construction with subgraph connectivity constraints
• The pairwise flowtime network construction problem
• Online and approximate network construction from bounded connectivity constraints
• Network construction problems with due dates

This page was built for publication: Network construction with ordered constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136326)