Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC '01
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM Press

1581133499

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Regular resolution lower bounds for the weak pigeonhole principle

Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC '01 ◽

10.1145/380752.380821 ◽

2001 ◽

Cited By ~ 8

Author(s):

Toniann Pitassi ◽

Ran Raz

Keyword(s):

Lower Bounds ◽

Pigeonhole Principle

Download Full-text

Non-approximability results for optimization problems on bounded degree instances

Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC '01 ◽

10.1145/380752.380839 ◽

2001 ◽

Cited By ~ 84

Author(s):

Luca Trevisan

Keyword(s):

Optimization Problems ◽

Bounded Degree

Download Full-text

Testing metric properties

Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC '01 ◽

10.1145/380752.380811 ◽

2001 ◽

Cited By ~ 4

Author(s):

Michal Parnas ◽

Dana Ron

Keyword(s):

Metric Properties

Download Full-text

The complexity of maximal constraint languages

Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC '01 ◽

10.1145/380752.380868 ◽

2001 ◽

Cited By ~ 38

Author(s):

Andrei Bulatov ◽

Andrei Krokhin ◽

Peter Jeavons

Keyword(s):

Constraint Languages

Download Full-text

Local search heuristic for k-median and facility location problems

Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC '01 ◽

10.1145/380752.380755 ◽

2001 ◽

Cited By ~ 137

Author(s):

Vijay Arya ◽

Naveen Garg ◽

Rohit Khandekar ◽

Kamesh Munagala ◽

Vinayaka Pandit

Keyword(s):

Local Search ◽

Facility Location ◽

Location Problems ◽

Search Heuristic ◽

Facility Location Problems ◽

Local Search Heuristic

Download Full-text

Computing crossing numbers in quadratic time

Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC '01 ◽

10.1145/380752.380805 ◽

2001 ◽

Cited By ~ 17

Author(s):

Martin Grohe

Keyword(s):

Crossing Numbers

Download Full-text

Optimal outlier removal in high-dimensional

Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC '01 ◽

10.1145/380752.380860 ◽

2001 ◽

Cited By ~ 6

Author(s):

John Dunagan ◽

Santosh Vempala

Keyword(s):

High Dimensional ◽

Outlier Removal

Download Full-text

Colouring graphs when the number of colours is nearly the maximum degree

Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC '01 ◽

10.1145/380752.380840 ◽

2001 ◽

Cited By ~ 7

Author(s):

Michael Molloy ◽

Bruce Reed

Keyword(s):

Maximum Degree

Download Full-text

Lower bounds for matrix product, in bounded depth circuits with arbitrary gates

Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC '01 ◽

10.1145/380752.380833 ◽

2001 ◽

Cited By ~ 3

Author(s):

Ran Raz ◽

Amir Shpilka

Keyword(s):

Lower Bounds ◽

Matrix Product ◽

Bounded Depth Circuits

Download Full-text

Approximation algorithms for constrained for constrained node weighted steiner tree problems

Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC '01 ◽

10.1145/380752.380826 ◽

2001 ◽

Cited By ~ 12

Author(s):

Anna Moss ◽

Yuval Rabani

Keyword(s):

Approximation Algorithms ◽

Steiner Tree ◽

Steiner Tree Problems

Download Full-text

Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC '01Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

Regular resolution lower bounds for the weak pigeonhole principle

Non-approximability results for optimization problems on bounded degree instances

Testing metric properties

The complexity of maximal constraint languages

Local search heuristic for k-median and facility location problems

Computing crossing numbers in quadratic time

Optimal outlier removal in high-dimensional

Colouring graphs when the number of colours is nearly the maximum degree

Lower bounds for matrix product, in bounded depth circuits with arbitrary gates

Approximation algorithms for constrained for constrained node weighted steiner tree problems

Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC '01
Latest Publications