Sciweavers

1933 search results - page 33 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
ICDCS
1998
IEEE
14 years 29 days ago
A Feedback Based Scheme for Improving TCP Performance in Ad-Hoc Wireless Networks
Ad-hoc networks consist of a set of mobile hosts that communicate using wireless links, without the use of other communication support facilities (such as base stations). The topo...
Kartik Chandran, Sudarshan Raghunathan, S. Venkate...
IPCCC
2006
IEEE
14 years 2 months ago
Cluster based approaches for end-to-end complete feedback collection in multicast
In this paper we study the end-to-end complete feedback collection (ECFC) problem in large scale multicast applications. We consider the case where each receiver is expected to se...
Mehmet Baysan, Kamil Saraç
MOC
2010
13 years 3 months ago
Optimizing the double description method for normal surface enumeration
Abstract. Many key algorithms in 3-manifold topology involve the enumeration of normal surfaces, which is based upon the double description method for finding the vertices of a con...
Benjamin A. Burton
FOCS
2006
IEEE
14 years 2 months ago
Improved approximation algorithms for multidimensional bin packing problems
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
Nikhil Bansal, Alberto Caprara, Maxim Sviridenko
ALGOSENSORS
2009
Springer
14 years 3 months ago
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
Zeev Nutov, Michael Segal