Sciweavers

220 search results - page 14 / 44
» corr 2002
Sort
View
CORR
2002
Springer
102views Education» more  CORR 2002»
14 years 9 months ago
Tight Approximation Results for General Covering Integer Programs
In this paper we study approximation algorithms for solving a general covering integer program. An
Stavros G. Kolliopoulos, Neal E. Young
CORR
2002
Springer
91views Education» more  CORR 2002»
14 years 9 months ago
Minimum-Energy Mobile Wireless Networks Revisited
We propose a protocol that, given a communication network, computes a subnetwork such that, for every pair
Erran L. Li, Joseph Y. Halpern
CORR
2002
Springer
125views Education» more  CORR 2002»
14 years 9 months ago
Greedy Facility Location Algorithms Analyzed using Dual Fitting with Factor-Revealing LP
Inthisarticle,wewillformalizethemethodofdualfittingandtheideaoffactor-revealingLP. This combination is used to design and analyze two greedy algorithms for the metric uncapacitated...
Kamal Jain, Mohammad Mahdian, Evangelos Markakis, ...
CORR
2002
Springer
135views Education» more  CORR 2002»
14 years 9 months ago
Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs
We improve on random sampling techniques for approximately solving problems that involve cuts and flows in graphs. We give a near-linear-time construction that transforms any grap...
András A. Benczúr, David R. Karger
CORR
2002
Springer
80views Education» more  CORR 2002»
14 years 9 months ago
Gales Suffice for Constructive Dimension
Supergales, generalizations of supermartingales, have been used by Lutz (2002) to define the constructive dimensions of individual binary sequences. Here it is shown that gales, t...
John M. Hitchcock