Login / Signup

Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver.

Parinya ChalermsookChien-Chung HuangDanupon NanongkaiThatchaphol SaranurakPattara SukprasertSorrachai Yingchareonthawornchai
Published in: CoRR (2022)
Keyphrases
  • linear programming
  • data structure
  • edge detection
  • weighted graph
  • linear program
  • edge information
  • worst case
  • edge detector
  • lower bound
  • gray level
  • undirected graph
  • labeled graphs
  • graph properties
  • connected subgraphs