No article text was recorded for this version.
global connectivity constraints
Version 1 of 129 papers33 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Optimal Region Search with Submodular Maximization
- Blog: Parameterized Complexity of Eulerian Deletion Problems
- Blog: FPT Approximations for Connected Maximum Coverage
- Blog: Survivable Network Design for Group Connectivity in Low-Treewidth Graphs
- Blog: Deterministic parameterized connected vertex cover
- Blog: Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs
- Blog: Efficient Nonparametric Subgraph Detection Using Tree Shaped Priors
- Blog: Augmentative Message Passing for Traveling Salesman Problem and Graph Partitioning
- Blog: A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case
- Blog: Approximating ATSP by Relaxing Connectivity
- Blog: AMR Parsing with an Incremental Joint Model
- Blog: Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
- Blog: Statistical Mechanics of Steiner Trees
- Blog: Mixed-integer programming techniques for the connected max-k-cut problem
- Blog: Matching Augmentation via Simultaneous Contractions
- Blog: Connected Subgraph Detection with Mirror Descent on SDPs
- Blog: On the Distribution of Minima in Intrinsic-Metric Rotation Averaging
- Blog: The number of dissociation sets in connected graphs
- Blog: Lossy Kernels for Connected Dominating Set on Sparse Graphs
- Blog: Box Facets and Cut Facets of Lifted Multicut Polytopes
- Blog: Approximation Algorithms for Connected Graph Factors of Minimum Weight
- Blog: Approximability of Connected Factors
- Blog: Reconstructing hv-Convex Polyominoes from Orthogonal Projections
- Blog: Finding densest k-connected subgraphs
- Blog: Balanced Connected Subgraph Problem in Geometric Intersection Graphs
- Blog: Concept-Map-Based Multi-Document Summarization using Concept Coreference Resolution and Global Importance Optimization
- Blog: Constant Factor Approximation for ATSP with Two Edge Weights
- Blog: Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Blog: Parameterized Algorithms for Directed Maximum Leaf Problems
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_global_connectivity_constraints_6411b763,
title = {global connectivity constraints},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/global-connectivity-constraints/rdr_6411b763a3a944868b3a4449be5a0d08},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_global_connectivity_constraints_6411b763_v1,
title = {global connectivity constraints},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/global-connectivity-constraints/rdr_6411b763a3a944868b3a4449be5a0d08/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}