Jiangtao Meng - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 5 from 5

2008

An improved lower bound for approximating minimum GCD multiplier in l::infinity:: norm (GCDM::infinity::)Wenbin Chen 0002, Jiangtao Meng, Dengpan Yin. TCS, 396(1-3):1-9, 2008. [doi]

2007

Approximation Algorithms for ::::k:::: -Duplicates Combinatorial Auctions with Subadditive BiddersWenbin Chen 0002, Jiangtao Meng. cocoa 2007: 163-170 [doi]

Hardness of approximating the Minimum Solutions of Linear Diophantine EquationsWenbin Chen 0002, Jiangtao Meng. TCS, 374(1-3):191-195, 2007. [doi]

An improved lower bound for approximating Shortest Integer Relation in ::::l::::::infinity:: norm (SIR::infinity::)Wenbin Chen 0002, Jiangtao Meng. ipl, 101(4):174-179, 2007. [doi]

2006

Inapproximability Results for the Closest Vector Problem with Preprocessing over infty NormWenbin Chen 0002, Jiangtao Meng. eccc, 13(052), 2006. [doi]

Sign in or sign up to see more results.

runs on WebDSL