FOCS 1998 - PDF Preprint Papers

FOCS 1998 Annual IEEE Symposium on Foundations of Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed FOCS-1998 Paper

click to vote

FOCS
1998
IEEE

150views Theoretical Computer Science» more FOCS 1998»

Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems

14 years 3 months ago

Download www.cs.gsu.edu

This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different ap...

Naveen Garg, Jochen Könemann

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	150	Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems	claim
2	131	A Characterization of NC by Tree Recurrence	claim
3	122	Parametric and Kinetic Minimum Spanning Trees	claim
4	119	Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems	claim
5	118	The Complexity of the Approximation of the Bandwidth Problem	claim
6	112	Towards an Optimal Bit-Reversal Permutation Program	claim
7	110	The Complexity of Acyclic Conjunctive Queries	claim
8	104	A Primitive Recursive Algorithm for the General Petri Net Reachability Problem	claim
9	102	Unsatisfiable Systems of Equations, Over a Finite Field	claim
10	97	Recommendation Systems: A Probabilistic Analysis	claim
11	94	Quantum Lower Bounds by Polynomials	claim
12	93	The Quantum Communication Complexity of Sampling	claim
13	90	Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations	claim
14	89	Jitter Control in QoS Networks	claim
15	89	A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time	claim
16	87	The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant	claim
17	87	A Divide-and-Conquer Algorithm for Min-Cost Perfect Matching in the Plane	claim
18	86	Protocols for Asymmetric Communication Channels	claim
19	86	On Learning Monotone Boolean Functions	claim
20	83	Delayed Information and Action in On-line Algorithms	claim
21	83	Marked Ancestor Problems	claim
22	83	Evolutionary Trees can be Learned in Polynomial Time in the Two-State General Markov Model	claim
23	82	Optimal Time-Space Trade-Offs for Sorting	claim
24	82	A Tight Characterization of NP with 3 Query PCPs	claim
25	81	Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem	claim
26	80	Concurrent Reachability Games	claim
27	78	Pattern Matching for Spatial Point Sets	claim
28	76	Which Crossing Number is it, Anyway?	claim
29	75	On the Single-Source Unsplittable Flow Problem	claim
30	74	Information Retrieval on the Web	claim
31	74	Oblivious Transfer with a Memory-Bounded Receiver	claim
32	73	Time-Space Tradeoffs for Branching Programs	claim
33	72	Approximating a Finite Metric by a Small Number of Tree Metrics	claim
34	72	The Finite Capacity Dial-A-Ride Problem	claim
35	72	Which Problems Have Strongly Exponential Complexity?	claim
36	72	Randomness vs. Time: De-Randomization under a Uniform Assumption	claim
37	70	Improved Bounds and Algorithms for Hypergraph Two-Coloring	claim
38	67	Testing Monotonicity	claim
39	67	Local Search in Smooth Convex Sets	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers