Chrobak Marek

Marek Chrobak

Information about the author Marek Chrobak will soon be added to the site.
Found 9 papers in total
Collecting Weighted Items from a Dynamic Queue
Collecting Weighted Items from a Dynamic Queue
2013
We consider online competitive algorithms for the problem of collecting weighted items...
Algorithms for Placing Monitors in a Flow Network
Algorithms for Placing Monitors in a Flow Network
2014
In the Flow Edge‐Monitor Problem, we are given an undirected graph G =( V , E...
Caching Is Hard–Even in the Fault Model
Caching Is Hard–Even in the Fault Model
2012
We prove strong ℕℙ ‐completeness for the four variants of caching...
Approximation algorithms for the Fault‐Tolerant Facility Placement problem
Approximation algorithms for the Fault‐Tolerant Facility Placement problem
2011
? We studied a generalized version of Facility Location (FL) problem. ? We...
Algorithms for testing fault-tolerance of sequenced jobs
Algorithms for testing fault-tolerance of sequenced jobs
2009
We study the problem of testing whether a given set of sequenced jobs can tolerate...
Incremental medians via online bidding
Incremental medians via online bidding
2008
In the k -median problem we are given sets of facilities and customers, and distances...
The complexity of mean flow time scheduling problems with release times
The complexity of mean flow time scheduling problems with release times
2007
We study the problem of preemptive scheduling of n jobs with given release times on m...
A note on scheduling equal-length jobs to maximize throughput
A note on scheduling equal-length jobs to maximize throughput
2006
Preemptive scheduling of equal-length jobs to maximize weighted throughput
Preemptive scheduling of equal-length jobs to maximize weighted throughput
2004
We study the problem of computing a preemptive schedule of equal-length jobs with...
Papers per page: