BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
weight (3)
time (3)
graph (2)
minim (2)
complet (2)

Stem ptas$ (all stems)

10 papers:

ICALPICALP-v1-2015-LiJ #problem
A PTAS for the Weighted Unit Disk Cover Problem (JL, YJ), pp. 898–909.
ICALPICALP-v1-2011-Nonner #clique #clustering #graph
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs (TN), pp. 183–194.
STOCSTOC-2009-DaskalakisP #equilibrium #nash #on the
On oblivious PTAS’s for nash equilibrium (CD, CHP), pp. 75–84.
ICALPICALP-A-2008-EisenbrandR #realtime #scheduling
A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation (FE, TR), pp. 246–257.
STOCSTOC-2006-BansalCES #graph
A quasi-PTAS for unsplittable flow on line graphs (NB, AC, AE, BS), pp. 721–729.
A PTAS for Embedding Hypergraph in a Cycle (Extended Abstract) (XD, GL), pp. 433–444.
ICALPICALP-2002-DengLLMW #string
A PTAS for Distinguishing (Sub)string Selection (XD, GL, ZL, BM, LW), pp. 740–751.
A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines (CC, SK), pp. 848–861.
STOCSTOC-1999-SkutellaW #parallel
A PTAS for Minimizing the Weighted Sum of Job Completion Times on Parallel Machines (MS, GJW), pp. 400–407.
STOCSTOC-1996-KhannaM #towards
Towards a Syntactic Characterization of PTAS (SK, RM), pp. 329–337.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.