3415 search results - page 344 / 683 » Lower bounds on kernelization |
128
click to vote
COCO
2005
Springer
16 years 7 days ago
2005
Springer
We propose a model called priority branching trees (pBT ) for backtracking and dynamic programming algorithms. Our model generalizes both the priority model of Borodin, Nielson an...
174
click to vote
COCOON
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. We present three streaming algorithms that ( , δ)− approximate 1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presente...
153
click to vote
ESA
2005
Springer
16 years 7 days ago
2005
Springer
The number of probes needed by the best possible algorithm for locally or globally optimizing a bivariate function varies substantially depending on the assumptions made about the ...
216
click to vote
MFCS
2005
Springer
16 years 6 days ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
158
click to vote
SSS
2005
Springer
16 years 5 days ago
2005
Springer
Dijkstra’s concept of self-stabilization assumes that faults can only affect the variables of a program. We study the notion of selfstabilization if faults can also affect (i.e...