Search Results - "Local Computation Algorithms"
-
1
New techniques and tighter bounds for local computation algorithms
ISSN: 0022-0000, 1090-2724Published: Elsevier Inc 01.11.2016Published in Journal of computer and system sciences (01.11.2016)“…Given an input x and a search problem F, local computation algorithms (LCAs) implement access to specified locations of y in a legal output y∈F(x), using…”
Get full text
Journal Article -
2
Local Computation of Maximal Independent Set
ISSN: 2575-8454Published: IEEE 01.10.2022Published in Proceedings / annual Symposium on Foundations of Computer Science (01.10.2022)“…We present a randomized Local Computation Algorithm (LCA) with query complexity poly (\Delta) \cdot \log n for the Maximal Independent Set (MIS) problem. That…”
Get full text
Conference Proceeding -
3
New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling
ISSN: 0178-4617, 1432-0541Published: New York Springer US 01.09.2024Published in Algorithmica (01.09.2024)“…Interval scheduling is a basic algorithmic problem and a classical task in combinatorial optimization. We develop techniques for partitioning and grouping jobs…”
Get full text
Journal Article -
4
Local Computation Algorithms for Graphs of Non-constant Degrees
ISSN: 0178-4617, 1432-0541Published: New York Springer US 01.04.2017Published in Algorithmica (01.04.2017)“…In the model of local computation algorithms (LCAs), we aim to compute the queried part of the output by examining only a small (sublinear) portion of the…”
Get full text
Journal Article -
5
Properly learning monotone functions via local correction
ISSN: 2575-8454Published: IEEE 01.10.2022Published in Proceedings / annual Symposium on Foundations of Computer Science (01.10.2022)“…We give a 2^{\tilde{O}(\sqrt{n}/\varepsilon)}-time algorithm for properly learning monotone Boolean functions under the uniform distribution over \{0,1\}^{n}…”
Get full text
Conference Proceeding -
6
Constant-Time Local Computation Algorithms
ISSN: 1432-4350, 1433-0490Published: New York Springer US 01.02.2018Published in Theory of computing systems (01.02.2018)“…Local computation algorithms (LCAs) produce small parts of a single (possibly approximate) solution to a given search problem using time and space sublinear in…”
Get full text
Journal Article -
7
GRASP/ Δ : An efficient algorithm for the multi-objective portfolio optimization problem
ISSN: 0957-4174Published: 01.01.2023Published in Expert systems with applications (01.01.2023)Get full text
Journal Article -
8
Local Conflict Coloring
ISSN: 0272-5428Published: IEEE 01.10.2016Published in Annual Symposium on Foundations of Computer Science (01.10.2016)“…Locally finding a solution to symmetry-breaking tasks such as vertex-coloring, edge-coloring, maximal matching, maximal independent set, etc., is a…”
Get full text
Conference Proceeding