A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
A Novel Bicriteria Scheduling Heuristics Providing a Guaranteed Global System Failure Rate

2009
*
IEEE Transactions on Dependable and Secure Computing
*

We propose a new framework

doi:10.1109/tdsc.2008.50
fatcat:jcyo2dmhwjd25hcdravz3et4jm
*for*the (length,reliability)*bicriteria*static multiprocessor*scheduling**problem*. ... To solve this*bicriteria*optimization*problem*, we take the failure rate as a constraint, and we minimize the*schedule*length. ... and to Thomas McGowan*for*his English proficiency. ...##
###
FlowFlex: Malleable Scheduling for Flows of MapReduce Jobs
[chapter]

2013
*
Lecture Notes in Computer Science
*

We employ resource augmentation analysis to provide

doi:10.1007/978-3-642-45065-5_6
fatcat:n6maqvcqdjhtfdcpmlviy2r6w4
*bicriteria**approximation**algorithms**for*both minisum and minimax objective functions. ... As corollaries, we obtain*approximation**algorithms**for*total weighted completion time (and thus average completion time and average stretch), and*for*maximum weighted completion time (and thus makespan ... The precedence constrained malleable*scheduling**problem**with*linear speedup admits the following guarantees. • (2, 3)-*bicriteria**approximation**algorithm**for*general minisum objectives. • (1, 2)-*bicriteria*...##
###
Multiply Balanced k −Partitioning
[chapter]

2014
*
Lecture Notes in Computer Science
*

We design

doi:10.1007/978-3-642-54423-1_51
fatcat:epjpr36o3zdbrpdyei277ykff4
*bicriteria**approximation**algorithms**for*this*problem*, i.e., they partition the vertices into up to k parts that are nearly balanced simultaneously*for*all weight functions, and their*approximation*... Our*algorithm*generalizes to d weight functions as follows:*For*vertex weights that are integers bounded by a polynomial in n and any fixed > 0, we obtain a (2d + , O(d √ log n log k))-*bicriteria**approximation*... Their*algorithm*uses an*algorithm**for*the ρ−separator*problem*in order to achieve a (2, log n)*bicriteria**approximation**with*an exponential weight function. ...##
###
Sublogarithmic approximation for telephone multicast

2006
*
Journal of computer and system sciences (Print)
*

In this paper we devise an O( log k log log k )-

doi:10.1016/j.jcss.2005.12.002
fatcat:hyzp7w3hjrgkhl32izj7rdbv6a
*approximation**algorithm**for*the k-multicast*problem*, and, consequently, an O( log n log log n )-*approximation**algorithm**for*the broadcast*problem*. ... Several*approximation**algorithms**with*a polylogarithmic ratio were suggested*for*these*problems*, and the upper bound on their*approximation*threshold stands currently on O(log k) and O(log n), respectively ... The depth-degree spanning tree*problem*admits an (O(log k/ log log k), O(log k/ log log k))*bicriteria**approximation*. ...##
###
Scheduling strategies for the bicriteria optimization of the robustness and makespan

2008
*
Proceedings, International Parallel and Distributed Processing Symposium (IPDPS)
*

In this paper we study the

doi:10.1109/ipdps.2008.4536366
dblp:conf/ipps/CanonJ08
fatcat:yfgyc2fnmbbchfobcl522yr3oe
*problem*of*scheduling*a stochastic task graph*with*the objective of minimizing the makespan and maximizing the robustness. ... We compare these different strategies experimentally and show that we are able to find different*approximations*of the Pareto front of this*bicriteria**problem*. ... In this paper we tackle the*bicriteria**problem*of*scheduling*an application*with*the objective of minimizing the makespan and maximizing the robustness. ...##
###
Compact location problems with budget and communication constraints
[chapter]

1995
*
Lecture Notes in Computer Science
*

We also present e cient

doi:10.1007/bfb0030872
fatcat:j5h2ydjas5f4plgif7nfydfta4
*approximation**algorithms**for*several of the*problems*studied, when both edge{weight functions obey the triangle inequality. ... We show that in general obtaining an ( ; ){*approximation**for*any xed ; 1 is NP{hard*for*any of these*problems*. ... We refer the reader to MR+95, RMR + 93]*for*a detailed survey of the work done in the area of*algorithms**for**bicriteria*network design and location theory*problems*. ...##
###
An open shop approach in approximating optimal data transmission duration in WDM networks
[article]

2017
*
arXiv
*
pre-print

We have combined these variations and called the induced

arXiv:1701.02030v1
fatcat:clluediyyzglzjcuwefbyq3w5u
*algorithm*HSA (Hybridic*Scheduling**Algorithm*). ... The*problem*of*scheduling*message packets through such a network is referred to as PBS and is known to be NP-Hard. ... In general, the*problem*is 4/3-ε inapproximable*for*all ε>0 as shown in [6] . The best guaranteed*approximation*ratio of any*algorithm*proposed*for*the*problem*is 1 2 d1 . ...##
###
Approximation Algorithms for the Traveling Purchaser Problem and Its Variants in Network Design
[chapter]

1999
*
Lecture Notes in Computer Science
*

We g i v e an

doi:10.1007/3-540-48481-7_4
fatcat:yb57bgkwq5gerfew3j72dc5rru
*approximation**algorithm**with*a poly-logarithmic worst-case ratio*for*the traveling purchaser*problem**with*metric travel costs. ...*For*a special case of the*problem*that models the ring-star network design*problem*, we g i v e a constant-factor*approximation**algorithm*. Our*algorithms*are based on rounding LP relaxation solutions. ... Hassin*for*proving the NP-hardness of the (A + T 1)*problem*and other helpful discussions. We also thank G. Konjevod*for*pointing out the direct reduction of TPP to a group Steiner tour*problem*. ...##
###
Multichannel Scheduling and Spanning Trees: Throughput–Delay Tradeoff for Fast Data Collection in Sensor Networks

2011
*
IEEE/ACM Transactions on Networking
*

To minimize the maximum delay subject to a given throughput bound, we also design an (α, β)

doi:10.1109/tnet.2011.2146273
fatcat:vienqx3kjzgjhl4c3eecmxv4v4
*bicriteria**approximation**algorithm*to construct a Bounded-Degree Minimum-Radius Spanning Tree,*with*the radius ... Lastly, we evaluate the efficiency of our*algorithms*on different types of spanning trees, and show that multi-channel*scheduling*, combined*with*optimal routing topologies, can achieve the best of both ... The first*bicriteria**approximation**algorithm*on general graphs is proposed by Ravi et al. ...##
###
Online Bicriteria Load Balancing for Distributed File Servers

2007
*
2007 Second International Conference on Communications and Networking in China
*

We propose two online

doi:10.1109/chinacom.2007.4469367
fatcat:2vr2pw3jynh2hijk5t5uc74oum
*approximate**algorithms**for*balancing the load and required storage space of each server during document placement. ... The second*algorithm*is*for*theoretical purpose. ... ACKNOWLEDGEMENT We thank the anonymous referees*for*their very useful comments. ...##
###
A Critical Improvement on Open Shop Scheduling Algorithm for Routing in Interconnection Networks

2017
*
International Journal of Computer Networks & Communications
*

The

doi:10.5121/ijcnc.2017.9101
fatcat:k55ulpk375cxte7wp4vzbqqpnq
*problem*of*scheduling*message packets through such a network is referred to as PBS and is known to be NP-Hard. ... We have combined these variations and called the induced algorithmI_HSA (Improved Hybridic*Scheduling**Algorithm*). ... of it, to minimize each criterion separately and combine the results to design an improved hybrid*algorithm*(I_HSA -Improved Hybridic*Scheduling**Algorithm*),which will tackle the*bicriteria**problem*efficiently ...##
###
Advances in discrete optimization

2013
*
Optimization
*

Acknowledgments We would like to thank all the authors

doi:10.1080/02331934.2013.817072
fatcat:6oaqj4ien5e53epn7mgxgom24a
*for*their interest in our special issue and their excellent contributions. ... Andreas Löhne, who currently serve as Editor-in-Chief and Managing Editor respectively of Optimization*for*their valuable support and assistance, but also Professor Juan Enrique Martinez-Legaz and Dr. ...*algorithm**for*linear programming*problems*. ...##
###
Joint sensing duty cycle scheduling for heterogeneous coverage guarantee

2017
*
IEEE INFOCOM 2017 - IEEE Conference on Computer Communications
*

We provide multiple

doi:10.1109/infocom.2017.8056961
dblp:conf/infocom/LiuMYAGGJKL17
fatcat:zoz7qdipsvafzfmt33b5zquube
*algorithms**with*best*approximation*ratio of O(log n + log m)*for*the maximum number of sensors to turn on, and bi-criteria*algorithm**with*(α, β)-*approximation*factors*with*high probability ... In this paper we study the following*problem*: given a set of m sensors that collectively cover a set of n target points*with*heterogeneous coverage requirements (target j needs to be covered every fj slots ... The*algorithm*gives a (qδ, β)-*bicriteria**approximation**with*high probability, where qβ = O(log(n) + log(m)), δ is the*approximation*ratio*for*the set multi-cover*problem*. ...##
###
A provably convergent heuristic for stochastic bicriteria integer programming

2008
*
Journal of Heuristics
*

We propose a general-purpose

doi:10.1007/s10732-008-9071-5
fatcat:iibqzbz2xbefpn5bnjfs552uyi
*algorithm*APS (Adaptive Pareto-Sampling)*for*determining the set of Pareto-optimal solutions of*bicriteria*combinatorial optimization (CO)*problems*under uncertainty, where ... APS is iterative and population-based and combines random sampling*with*the solution of corresponding deterministic*bicriteria*CO*problem*instances. ... Proposition 4 . 1 . 41*For*a*bicriteria*stochastic knapsack*problem*(15)*with*the properties • a i > 0*for*all i, Fig. 3 . 3*Approximations*to the Pareto front in Example 1 after 10, 100 and 300 iterations ...##
###
Balanced Graph Partitioning

2006
*
Theory of Computing Systems
*

We present a

doi:10.1007/s00224-006-1350-7
fatcat:j62uqospbvg5pgm5373e6xheea
*bicriteria*polynomial time*approximation**algorithm**with*an O(log 2 n)-*approximation**for*any constant ν > 1. ...*For*ν = 1 we show that no polytime*approximation**algorithm*can guarantee a finite*approximation*ratio unless P = N P . ... We seek a*bicriteria**approximation**algorithm**for*this*problem*; we compare the cost of an*approximation**algorithm*to the cost of the optimum (k, 1)-balanced partitioning*algorithm*that has to output parts ...
« Previous

*Showing results 1 — 15 out of 272 results*