Výsledky vyhľadávania - "randomized approximation algorithms"
-
1
Randomized approximation algorithms for monotone k-submodular function maximization with constraints
ISSN: 1382-6905, 1573-2886Vydavateľské údaje: New York Springer US 01.05.2025Vydané v Journal of combinatorial optimization (01.05.2025)“…In recent years, k -submodular functions have garnered significant attention due to their natural extension of submodular functions and their practical…”
Získať plný text
Journal Article -
2
Randomized approximation algorithms for planar visibility counting problem
ISSN: 0304-3975, 1879-2294Vydavateľské údaje: Elsevier B.V 10.01.2018Vydané v Theoretical computer science (10.01.2018)“…Given a set S of n disjoint line segments in R2, the visibility counting problem (VCP) is to preprocess S such that the number of segments in S visible from…”
Získať plný text
Journal Article -
3
Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks
ISSN: 0166-218X, 1872-6771Vydavateľské údaje: Elsevier B.V 01.04.2007Vydané v Discrete Applied Mathematics (01.04.2007)“…In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our…”
Získať plný text
Journal Article -
4
Approximating average parameters of graphs
ISSN: 1042-9832, 1098-2418Vydavateľské údaje: Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.07.2008Vydané v Random structures & algorithms (01.07.2008)“…Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we…”
Získať plný text
Journal Article -
5
Triangle Counting in Dynamic Graph Streams
ISSN: 0178-4617, 1432-0541Vydavateľské údaje: New York Springer US 01.09.2016Vydané v Algorithmica (01.09.2016)“…Estimating the number of triangles in graph streams using a limited amount of memory has become a popular topic in the last decade. Different variations of the…”
Získať plný text
Journal Article -
6
Additive Noise Mechanisms for Making Randomized Approximation Algorithms Differentially Private
ISSN: 2331-8422Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 18.07.2023Vydané v arXiv.org (18.07.2023)“…The exponential increase in the amount of available data makes taking advantage of them without violating users' privacy one of the fundamental problems of…”
Získať plný text
Paper -
7
Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks
ISSN: 1045-9219, 1558-2183Vydavateľské údaje: New York IEEE 01.01.2009Vydané v IEEE transactions on parallel and distributed systems (01.01.2009)“…While there are distributed algorithms for the MST problem, these algorithms require relatively large number of messages and time; this makes these algorithms…”
Získať plný text
Journal Article -
8
Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks: Computational molecular biology series, issue V
ISSN: 0166-218XVydavateľské údaje: Amsterdam Elsevier 2007Vydané v Discrete applied mathematics (2007)Získať plný text
Journal Article -
9
Probabilistic verification and approximation
ISSN: 0168-0072Vydavateľské údaje: Elsevier B.V 01.03.2008Vydané v Annals of pure and applied logic (01.03.2008)“… We show how some simple randomized approximation algorithms can improve the efficiency of verification of such probabilistic specifications and can be implemented in a probabilistic model checker…”
Získať plný text
Journal Article -
10
Randomized priority algorithms
ISSN: 0304-3975, 1879-2294Vydavateľské údaje: Oxford Elsevier B.V 06.06.2010Vydané v Theoretical computer science (06.06.2010)“…Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper…”
Získať plný text
Journal Article -
11
Algorithmic Issues in Reverse Engineering of Protein and Gene Networks via the Modular Response Analysis Method
ISSN: 0077-8923, 1749-6632, 1930-6547Vydavateľské údaje: Malden, USA Blackwell Publishing Inc 01.12.2007Vydané v Annals of the New York Academy of Sciences (01.12.2007)“…: This paper studies a computational problem motivated by the modular response analysis method for reverse engineering of protein and gene networks. This…”
Získať plný text
Journal Article -
12
Maximizing the effectiveness of a pediatric vaccine formulary while prohibiting extraimmunization
ISSN: 1386-9620, 1572-9389Vydavateľské údaje: Boston Springer US 01.12.2008Vydané v Health care management science (01.12.2008)“…The growing complexity of the United States Recommended Childhood Immunization Schedule has resulted in as many as five required injections during a single…”
Získať plný text
Journal Article -
13
Parallel and randomized approximation algorithms for MAXCLIQUE and MAXCUT and their applications
ISBN: 9798209162476Vydavateľské údaje: ProQuest Dissertations & Theses 01.01.1995“…The work in this thesis lies at the confluence of several areas of computer science, most importantly, the analysis of randomized approximation algorithms for NP-hard problems, parallel computation…”
Získať plný text
Dissertation -
14
Nonlinear formulations and improved randomized approximation algorithms for multiway and multicut problems
Vydavateľské údaje: St. Louis Federal Reserve Bank of St. Louis 01.01.1995Vydané v IDEAS Working Paper Series from RePEc (01.01.1995)Získať plný text
Paper -
15
A randomized approximation algorithm for metric triangle packing
ISSN: 1382-6905, 1573-2886Vydavateľské údaje: New York Springer US 01.01.2021Vydané v Journal of combinatorial optimization (01.01.2021)“…Given an edge-weighted complete graph G on 3 n vertices, the maximum-weight triangle packing problem asks for a collection of n vertex-disjoint triangles in G…”
Získať plný text
Journal Article -
16
A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times
ISSN: 0305-0548, 1873-765X, 0305-0548Vydavateľské údaje: New York Elsevier Ltd 01.06.2021Vydané v Computers & operations research (01.06.2021)“…•A new a parallel randomized approximation algorithm for the non-preemptive single machine scheduling problem with release dates and delivery times…”
Získať plný text
Journal Article -
17
A randomized approximation algorithm for the minimal-norm static-output-feedback problem
ISSN: 0005-1098, 1873-2836Vydavateľské údaje: Elsevier Ltd 01.01.2016Vydané v Automatica (Oxford) (01.01.2016)“…A new randomized algorithm is suggested, for extracting static-output-stabilizing-feedbacks, with approximately minimal-norm, for LTI systems. The algorithm…”
Získať plný text
Journal Article -
18
A linear time randomized approximation algorithm for Euclidean matching
ISSN: 0920-8542, 1573-0484Vydavateľské údaje: New York Springer US 01.05.2019Vydané v The Journal of supercomputing (01.05.2019)“… We propose a simple randomized approximation algorithm based on the geometrical aspect of the problem with O ( n ) expected time…”
Získať plný text
Journal Article -
19
Rare Event Simulation and Counting Problems
ISBN: 9780470772690, 0470772697Vydavateľské údaje: Chichester, UK John Wiley & Sons, Ltd 20.03.2009Vydané v Rare Event Simulation using Monte Carlo Methods (20.03.2009)“…Introduction Background material Approximate counting, sampling and Markov chain Monte Carlo Illustrating counting strategies Blending importance sampling and…”
Získať plný text
Kapitola -
20
An improved randomized approximation algorithm for maximum triangle packing
ISSN: 0166-218X, 1872-6771Vydavateľské údaje: Kidlington Elsevier B.V 06.04.2009Vydané v Discrete Applied Mathematics (06.04.2009)“…This paper deals with the maximum triangle packing problem. For this problem, Hassin and Rubinstein gave a randomized polynomial-time approximation algorithm…”
Získať plný text
Journal Article

