Results 31 to 40 of about 1,275,858 (359)
On the Advice Complexity of Online Matching on the Line [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe consider the matching problem on the line with advice complexity. We give a 1-competitive online algorithm with advice complexity $n-1,$ and show that there is no 1-competitive online algorithm reading less than $n-1$ bits of advice.
Béla Csaba, Judit Nagy-György
doaj +1 more source
Prioritized Metric Structures and Embedding [PDF]
, 2015 Metric data structures (distance oracles, distance labeling schemes, routing schemes) and low-distortion embeddings provide a powerful algorithmic methodology, which has been successfully applied for approximation algorithms \cite{llr}, online algorithms
Abraham Ittai +4 more
core +1 more source
The IBMAP approach for Markov networks structure learning [PDF]
, 2014 In this work we consider the problem of learning the structure of Markov networks from data. We present an approach for tackling this problem called IBMAP, together with an efficient instantiation of the approach: the IBMAP-HC algorithm, designed for ...
Alejandro Edera +20 more
core +2 more sources
Approximating optimization problems in graphs with locational uncertainty [PDF]
Discrete Mathematics & Theoretical Computer ScienceMany combinatorial optimization problems can be formulated as the search for a subgraph that satisfies certain properties and minimizes the total weight. We assume here that the vertices correspond to points in a metric space and can take any position in
Marin Bougeret +2 more
doaj +1 more source
Extension Complexity, MSO Logic, and Treewidth [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We consider the convex hull $P_{\varphi}(G)$ of all satisfying assignments of a given MSO formula $\varphi$ on a given graph $G$. We show that there exists an extended formulation of the polytope $P_{\varphi}(G)$ that can be described by $f(|\varphi ...
Petr Kolman +2 more
doaj +1 more source
Non-adaptive Group Testing on Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Grebinski and Kucherov (1998) and Alon et al. (2004-2005) study the problem of learning a hidden graph for some especial cases, such as hamiltonian cycle, cliques, stars, and matchings.
Hamid Kameli
doaj +1 more source
Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 Given a boolean predicate $\Pi$ on labeled networks (e.g., proper coloring, leader election, etc.), a self-stabilizing algorithm for $\Pi$ is a distributed algorithm that can start from any initial configuration of the network (i.e., every node has an ...
Lélia Blin +2 more
doaj +1 more source
A Linear Kernel for Planar Total Dominating Set [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A total dominating set of a graph $G=(V,E)$ is a subset $D \subseteq V$ such that every vertex in $V$ is adjacent to some vertex in $D$. Finding a total dominating set of minimum size is NP-hard on planar graphs and W[2]-complete on general graphs when ...
Valentin Garnero, Ignasi Sau
doaj +1 more source
Improved kernels for Signed Max Cut parameterized above lower bound on (r,l)-graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 A graph $G$ is signed if each edge is assigned $+$ or $-$. A signed graph is balanced if there is a bipartition of its vertex set such that an edge has sign $-$ if and only if its endpoints are in different parts.
Luerbio Faria +3 more
doaj +1 more source
Introduction to local certification [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 A distributed graph algorithm is basically an algorithm where every node of a graph can look at its neighborhood at some distance in the graph and chose its output.
Laurent Feuilloley
doaj +1 more source