Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
15
click to vote
ICALP
2000
Springer
favorite
Email
discuss
report
100
views
Programming Languages
»
more
ICALP 2000
»
Hardness of Set Cover with Intersection 1
14 years 3 days ago
Download
www.cs.ust.hk
V. S. Anil Kumar, Sunil Arya, H. Ramesh
Real-time Traffic
ICALP 2000
|
Programming Languages
|
claim paper
Related Content
»
A new multilayered PCP and the hardness of hypergraph vertex cover
»
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
»
A Threshold of ln n for Approximating Set Cover
»
The Checkpoint Problem
»
On intersecting hypergraphs
»
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
»
Efficient and Effective Practical Algorithms for the SetCovering Problem
»
The Complexity of Computing Minimal Unidirectional Covering Sets
»
Biobjective evolutionary and heuristic algorithms for intersection of geometric graphs
more »
Post Info
More Details (n/a)
Added
24 Aug 2010
Updated
24 Aug 2010
Type
Conference
Year
2000
Where
ICALP
Authors
V. S. Anil Kumar, Sunil Arya, H. Ramesh
Comments
(0)
Researcher Info
Programming Languages Study Group
Computer Vision