Results 1  10
of
2,805,870
A constant approximation algorithm for sorting buffers
 In LATIN 04
, 2004
"... Abstract We consider an algorithmic problem that arises in manufacturing applications. The input is a sequence of objects of various types. The scheduler is fed the objects in the sequence one by one, and is equipped with a finite buffer. The goal of the scheduler/sorter is to maximally reduce the n ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
the number of type transitions. We give the first polynomialtime constant approximation algorithm for this problem. We prove several lemmas about the combinatorial structure of optimal solutions that may be useful in future research, and we show that the unified algorithm based on the local ratio lemma
A Constant Approximation Algorithm for the OneWarehouse MultiRetailer Problem
 SUBMITTED TO MANAGEMENT SCIENCE
"... Deterministic inventory theory provides streamlined optimization models that attempt to capture tradeoffs in managing the flow of goods through a supply chain. We will consider two wellstudied deterministic inventory models, called the onewarehouse multiretailer problem (OWMR) and its special cas ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
algorithm. Our results are based on an LProunding approach; we provide the first constant approximation algorithm for the OWMR problem and improve the previous results for the JRP problem.
A constant approximation algorithm for the densest ksubgraph problem on chordal graphs
, 2008
"... ..."
Constant Approximation Algorithm for MST in Resource Constrained Wireless Sensor Networks
"... We consider lightweight wireless sensor networks constructed from lowprofile and resource constrained wireless embedded systems. Each individual unit in these networks has limited computation, memory and power resources. Traditional models of computation and algorithms will no longer be suitable fo ..."
Abstract
 Add to MetaCart
is independent of network size. Moreover, our developed algorithm yields a constant approximation ratio in which the weight of the constructed spanning tree is O(weight(MST)). We evaluated out algorithm through simulation and observed that the approximation ratio is about 1.2 on average. 1
Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs
, 2012
"... ..."
T.Lee, A constant approximation algorithm for interference aware broadcast in wireless networks, in
 IEEE INFOCOM
"... Abstract — Broadcast protocols play a vital role in multihop wireless networks. Due to the broadcast nature of radio signals, a node’s interference range can be larger than its transmission range, i.e., it can interfere with other node’s reception even if the latter is not within its transmission ra ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
. By exploiting the geometry property of the nodes that interfere with each other, we show that our algorithm is a constant approximation algorithm, it guarantees to deliver the message to all nodes within a small constant factor of the optimal makespan. We apply our algorithm under both the unit disk graph model
A constant approximation algorithm for link scheduling in arbitrary networks under physical interference model
 Proc. ACM FOWANC
, 2009
"... Link scheduling is crucial in improving the throughput in wireless networks and it has been widely studied under various interference models. In this paper, we study the link scheduling problem under physical interference model where all senders of the links transmit at a given power P and a link ca ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
successfully in one timeslot, given a set of input links. This problem has been shown to be NPhard [10]. Here we propose the first link scheduling algorithm with a constant approximation ratio for arbitrary background noise N ≥ 0. When each link l has a weight w(l)> 0, we propose a method for weighted MIS
Two Constant Approximation Algorithms for NodeWeighted Steiner Tree in Unit Disk Graphs
"... Abstract. Given a graph G = (V, E) with node weight w: V → R + and a subset S ⊆ V, find a minimum total weight tree interconnecting all nodes in S. This is the nodeweighted Steiner tree problem which will be studied in this paper. In general, this problem is NPhard and cannot be approximated by a ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
polynomial time algorithm with performance ratio a ln n for any 0 < a < 1 unless NP ⊆ DTIME(n O(log n)), where n is the number of nodes in s. In this paper, we show that for unit disk graph, the problem is still NPhard, however it has polynomial time constant approximation. We will present a 4
Results 1  10
of
2,805,870