咨询与建议

限定检索结果

文献类型

  • 4 篇 期刊文献
  • 1 篇 会议

馆藏范围

  • 5 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 5 篇 工学
    • 5 篇 计算机科学与技术...
  • 3 篇 理学
    • 3 篇 数学
  • 1 篇 管理学
    • 1 篇 管理科学与工程(可...

主题

  • 5 篇 sublinear approx...
  • 2 篇 graph algorithms
  • 2 篇 centralized loca...
  • 2 篇 distance approxi...
  • 2 篇 property testing
  • 1 篇 minimum vertex c...
  • 1 篇 graph properties
  • 1 篇 monotonicity
  • 1 篇 algorithms
  • 1 篇 distributed loca...
  • 1 篇 distributed algo...
  • 1 篇 theory
  • 1 篇 maximum matching
  • 1 篇 maximum weighted...

机构

  • 2 篇 tel aviv univ sc...
  • 1 篇 tel aviv univ de...
  • 1 篇 ben gurion univ ...
  • 1 篇 tel aviv univ de...
  • 1 篇 acad coll tel av...
  • 1 篇 tel aviv univ de...

作者

  • 5 篇 ron dana
  • 2 篇 medina moti
  • 2 篇 even guy
  • 1 篇 marko sharon
  • 1 篇 parnas michal
  • 1 篇 fattal shahar

语言

  • 5 篇 英文
检索条件"主题词=Sublinear approximation algorithms"
5 条 记 录,以下是1-10 订阅
排序:
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
收藏 引用
THEORETICAL COMPUTER SCIENCE 2007年 第1-3期381卷 183-196页
作者: Parnas, Michal Ron, Dana Acad Coll Tel Aviv Yaffo Sch Comp Sci Tel Aviv Israel Tel Aviv Univ Dept EE Syst Ramat Aviv Israel
For a given graph G over n vertices, let OPTG denote the size of an optimal solution in G of a particular minimization problem (e.g., the size of a minimum vertex cover). A randomized algorithm will be called an alpha... 详细信息
来源: 评论
Approximating the Distance to Properties in Bounded-Degree and General Sparse Graphs
收藏 引用
ACM TRANSACTIONS ON algorithms 2009年 第2期5卷 1–28页
作者: Marko, Sharon Ron, Dana Tel Aviv Univ Dept Elect Engn Syst IL-69978 Tel Aviv Israel
We address the problem of approximating the distance of bounded-degree and general sparse graphs from having some predetermined graph property P. That is, we are interested in sublinear algorithms for estimating the f... 详细信息
来源: 评论
Best of two local models: Centralized local and distributed local algorithms
收藏 引用
INFORMATION AND COMPUTATION 2018年 262卷 69-89页
作者: Even, Guy Medina, Moti Ron, Dana Tel Aviv Univ Sch Elect Engn IL-69978 Tel Aviv Israel Ben Gurion Univ Negev Dept Elect & Comp Engn IL-8410501 Beer Sheva Israel
We consider two models of computation: centralized local algorithms and local distributed algorithms. algorithms in one model are adapted to the other model to obtain improved algorithms. Distributed vertex coloring i... 详细信息
来源: 评论
Approximating the Distance to Monotonicity in High Dimensions
收藏 引用
ACM TRANSACTIONS ON algorithms 2010年 第3期6卷 1–37页
作者: Fattal, Shahar Ron, Dana Tel Aviv Univ Dept Engn IL-69978 Tel Aviv Israel
In this article we study the problem of approximating the distance of a function f : [n](d) -> R to monotonicity where [n] = {1,..., n} and R is some fully ordered range. Namely, we are interested in randomized sub... 详细信息
来源: 评论
Deterministic Stateless Centralized Local algorithms for Bounded Degree Graphs
收藏 引用
22nd Annual European Symposium on algorithms (ESA) held as part of ALGO Meeting
作者: Even, Guy Medina, Moti Ron, Dana Tel Aviv Univ Sch Elect Engn IL-69978 Tel Aviv Israel
We design centralized local algorithms for: maximal independent set, maximal matching, and graph coloring. The improvement is threefold: the algorithms are deterministic, stateless, and the number of probes is O(log* ... 详细信息
来源: 评论