Computing (1 + ϵ)-Approximate Degeneracy in Sublinear Time

被引：0
|
作者：
King, Valerie [1 ]
Thomo, Alex [1 ]
Yong, Quinton [1 ]
机构：
[1] University of Victoria, Victoria, Canada
来源：
IJCAI International Joint Conference on Artificial Intelligence | 2023年 / 2023-August卷
关键词：
Compilation and indexing terms; Copyright 2025 Elsevier Inc;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：2160 / 2168
相关论文
共 50 条
  • [1] Computing (1+∈)-Approximate Degeneracy in Sublinear Time
    King, Valerie
    Thomo, Alex
    Yong, Quinton
    PROCEEDINGS OF THE THIRTY-SECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2023, 2023, : 2160 - 2168
  • [2] Sublinear time approximate clustering
    Mishra, N
    Oblinger, D
    Pitt, L
    PROCEEDINGS OF THE TWELFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2001, : 439 - 447
  • [3] Separating sublinear time computations by approximate diameter
    Fu, Bin
    Zhao, Zhiyu
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2009, 18 (04) : 393 - 416
  • [4] Separating sublinear time computations by approximate diameter
    Bin Fu
    Zhiyu Zhao
    Journal of Combinatorial Optimization, 2009, 18 : 393 - 416
  • [5] Computing String Covers in Sublinear Time
    Radoszewski, Jakub
    Zuba, Wiktor
    STRING PROCESSING AND INFORMATION RETRIEVAL, SPIRE 2024, 2025, 14899 : 272 - 288
  • [6] Sublinear time algorithms for approximate semidefinite programming
    Dan Garber
    Elad Hazan
    Mathematical Programming, 2016, 158 : 329 - 361
  • [7] Sublinear time algorithms for approximate semidefinite programming
    Garber, Dan
    Hazan, Elad
    MATHEMATICAL PROGRAMMING, 2016, 158 (1-2) : 329 - 361
  • [8] Separating sublinear time computations by approximate diameter
    Fu, Bin
    Zhao, Zhiyu
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PROCEEDINGS, 2008, 5165 : 79 - +
  • [9] Dynamic (1+ε)-Approximate Matching Size in Truly Sublinear Update Time
    Bhattacharya, Sayan
    Kiss, Peter
    Saranurak, Thatchaphol
    2023 IEEE 64TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS, 2023, : 1563 - 1588
  • [10] Sublinear Time Algorithms and Complexity of Approximate Maximum Matching
    Behnezhad, Soheil
    Roghani, Mohammad
    Rubinstein, Aviad
    PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023, 2023, : 267 - 280
12345