Suchergebnisse - "Randomized approximation algorithms"

Randomized approximation algorithms for monotone k-submodular function maximization with constraints von Li, Yuying, Li, Min, Zhou, Yang, Niu, Shuxian, Liu, Qian

“… In recent years, k -submodular functions have garnered significant attention due to their natural extension of submodular functions and their practical …”
Volltext

Randomized approximation algorithms for planar visibility counting problem von Alipour, Sharareh, Ghodsi, Mohammad, Jafari, Amir

“… 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 …”
Volltext

Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks von Berman, Piotr, DasGupta, Bhaskar, Sontag, Eduardo

“… In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our …”
Volltext

Approximating average parameters of graphs von Goldreich, Oded, Ron, Dana

“… Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we …”
Volltext

Triangle Counting in Dynamic Graph Streams von Bulteau, Laurent, Froese, Vincent, Kutzkov, Konstantin, Pagh, Rasmus

“… 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 …”
Volltext

Additive Noise Mechanisms for Making Randomized Approximation Algorithms Differentially Private von Tětek, Jakub

“… The exponential increase in the amount of available data makes taking advantage of them without violating users' privacy one of the fundamental problems of …”
Volltext

Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks von Khan, M., Pandurangan, G., Anil Kumar, V.S.

“… While there are distributed algorithms for the MST problem, these algorithms require relatively large number of messages and time; this makes these algorithms …”
Volltext

Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks: Computational molecular biology series, issue V von BERMAN, Piotr, DASGUPTA, Bhaskar, SOFLTAG, Eduardo

Volltext

Probabilistic verification and approximation von Lassaigne, Richard, Peyronnet, Sylvain

“… 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 …”
Volltext

Randomized priority algorithms von Angelopoulos, Spyros, Borodin, Allan

“… Borodin, Nielsen and Rackoff  [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper …”
Volltext

Algorithmic Issues in Reverse Engineering of Protein and Gene Networks via the Modular Response Analysis Method von BERMAN, PIOTR, DASGUPTA, BHASKAR, SONTAG, EDUARDO

“… :  This paper studies a computational problem motivated by the modular response analysis method for reverse engineering of protein and gene networks. This …”
Volltext

Maximizing the effectiveness of a pediatric vaccine formulary while prohibiting extraimmunization von Hall, Shane N., Sewell, Edward C., Jacobson, Sheldon H.

“… The growing complexity of the United States Recommended Childhood Immunization Schedule has resulted in as many as five required injections during a single …”
Volltext

Parallel and randomized approximation algorithms for MAXCLIQUE and MAXCUT and their applications von Peinado, Marcus

“… 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 …”
Volltext

Nonlinear formulations and improved randomized approximation algorithms for multiway and multicut problems von Bertsimas, Dimitris, Teo, Chungpiaw, Vohra, Rakesh V

Volltext

A randomized approximation algorithm for metric triangle packing von Chen, Yong, Chen, Zhi-Zhong, Lin, Guohui, Wang, Lusheng, Zhang, An

“… 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 …”
Volltext

A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times von Badri, Hossein, Bahreini, Tayebeh, Grosu, Daniel

“… •A new a parallel randomized approximation algorithm for the non-preemptive single machine scheduling problem with release dates and delivery times …”
Volltext

A randomized approximation algorithm for the minimal-norm static-output-feedback problem von Peretz, Yossi (Joseph)

“… A new randomized algorithm is suggested, for extracting static-output-stabilizing-feedbacks, with approximately minimal-norm, for LTI systems. The algorithm …”
Volltext

A linear time randomized approximation algorithm for Euclidean matching von Imanparast, Mahdi, Hashemi, Seyed Naser

“… We propose a simple randomized approximation algorithm based on the geometrical aspect of the problem with O ( n ) expected time …”
Volltext

Rare Event Simulation and Counting Problems von Blanchet, José, Rudoy, Daniel

“… Introduction Background material Approximate counting, sampling and Markov chain Monte Carlo Illustrating counting strategies Blending importance sampling and …”
Volltext

An improved randomized approximation algorithm for maximum triangle packing von Chen, Zhi-Zhong, Tanahashi, Ruka, Wang, Lusheng

“… This paper deals with the maximum triangle packing problem. For this problem, Hassin and Rubinstein gave a randomized polynomial-time approximation algorithm …”
Volltext