作  者
期刊 & 会议
年  份
Mariano Zelke 的引文(17) 排序方式:
Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem  
In this paper we study linear-programming based approaches to the maximum matching problem in the semi-streaming model. In this model edges are presented sequentially, possibly in an adversarial order......
 2012
2次引用 0 0
Intractability of min- and max-cut in streaming graphs  
We show that the exact computation of a minimum or a maximum cut of a given graph G is out of reach for any one-pass streaming algorithm, that is, for any algorithm that runs over the input stream of......
Information Processing Letters  2011
0次引用 0 0
IMPROVED APPROXIMATION GUARANTEES FOR WEIGHTED MATCHING IN THE SEMI-STREAMING MODEL  
We study the maximum weight matching problem in the semi-streaming model, and improve on the currently best one-pass algorithm due to Zelke (Proc. STACS ’08, pages 669–680) by devising a deterministic......
 2010
8次引用 0 0
Maintaining a large matching and a small vertex cover  
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge insertion. We give the ......
ACM Symposium on Theory of Computing  2010
3次引用 0 0
Annotations in Data Streams  
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database and data stream proc......
International Colloquium on Automata, Languages and Programming  2009
7次引用 0 0
Improved approximation guarantees for weighted matching in the semi-streaming model  
We study the maximum weight matching problem in the semi-streaming model, and improve on the currently best one-pass algorithm due to Zelke (Proc. of STACS2008, pages 669-680) by devising a determinis......
Computing Research Repository  2009
3次引用 0 0
Graph Mining on Streams  
 2009
1次引用 0 0
Graph Mining on Streams  
 2009
1次引用 0 0
Weighted Matching in the Semi-Streaming Model  
We reduce the best known approximation ratio for finding a weighted matching of a graph using a one-pass semi-streaming algorithm from 5.828 to 5.585. The semi-streaming model forbids random access to......
Symposium on Theoretical Aspects of Computer Science  2008
8次引用 0 0
Graph Distances in the Data-Stream Model  
We explore problems related to computing graph distances in the data-stream model. The goal is to design algorithms that can process the edges of a graph in an arbitrary order given only a limited amo......
Siam Journal on Computing  2008
20次引用 0 0

1/2 第一页 上一页 1 2 下一页
Feedback
Feedback
Feedback
我想反馈:
排行榜