Entry Marathe:1997:HSU from tcs1995.bib
Last update: Sun Oct 15 02:56:11 MDT 2017
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Marathe:1997:HSU,
author = "Madhav V. Marathe and Venkatesh Radhakrishnan and
Harry B. {Hunt III} and S. S. Ravi",
title = "Hierarchically specified unit disk graphs",
journal = j-THEOR-COMP-SCI,
volume = "174",
number = "1--2",
pages = "23--65",
day = "15",
month = mar,
year = "1997",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:42 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=174&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1997&volume=174&issue=1-2&aid=2211",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1180
(Optimisation techniques); C4130 (Interpolation and
function approximation); C4240C (Computational
complexity)",
corpsource = "Los Alamos Nat. Lab., NM, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "1-level restricted hierarchical specifications;
complexity; computational complexity; function
approximation; graph theory; hierarchically specified
unit disk graphs; maximum independent set; minimum
clique cover; minimum dominating set; minimum
independent dominating set; minimum vertex coloring;
natural PSPACE-hard functions; optimisation;
optimization problems; polynomial-time approximation
algorithms; PSPACE-hardness; set theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- approximation,
134(1)51,
137(1)145,
138(1)3,
143(1)167,
143(2)353,
144(1)67,
147(1)267,
150(1)1,
154(1)41,
157(1)3,
157(1)53,
157(1)115,
157(1)129,
157(2)161,
157(2)259,
158(1)117,
159(2)143,
161(1)1,
161(1)307,
162(2)173,
162(2)351,
165(1)57,
168(1)3,
168(1)39,
172(1)255,
173(1)49,
177(1)3,
178(1)265,
179(1)319,
179(1)427,
180(1)17,
180(1)243,
181(2)379,
182(1)233,
187(1)87,
187(1)105,
187(1)179,
187(1)z,
190(2)151,
190(2)167,
191(1)1,
197(1)111,
207(1)171,
209(1)107,
210(2)261,
210(2)327,
212(1)261,
266(1)997
- C1180,
137(2)253,
138(1)3,
146(1)69,
146(1)269,
147(1)181,
147(1)267,
148(1)33,
148(2)325,
150(1)1,
156(1)217,
157(2)215,
158(1)117,
158(1)279,
162(2)225,
162(2)323,
164(1)1,
164(1)59,
172(1)265,
173(1)3,
179(1)251,
182(1)217,
188(1)129,
188(1)221,
191(1)193,
191(1)229,
194(1)207,
196(1)365,
197(1)245-2
- C4130,
143(1)167,
154(1)41,
157(1)3,
157(1)53,
157(1)115,
157(1)129,
157(2)259,
158(1)117,
159(2)143,
168(1)3,
168(1)39,
172(1)255,
180(1)17,
180(1)243,
187(1)87,
187(1)105,
187(1)179,
187(1)z,
191(1)1,
197(1)111
- clique,
148(1)93,
181(1)91,
181(2)337,
197(1)243-1
- coloring,
147(1)211,
157(2)161
- cover,
142(2)299,
145(1)111,
147(1)267,
149(1)129,
158(1)117,
164(1)299,
166(1)221,
187(1)167,
205(1)85,
225(1)113,
225(1)163
- dominating,
138(2)273,
209(1)123
- hard, PSPACE-,
143(1)93
- hierarchical,
138(1)211,
140(2)249,
140(2)265,
151(2)487,
156(1)177,
160(1)87,
194(1)243,
196(1)215,
197(1)157,
224(1)35
- independent,
145(1)381,
148(1)57,
148(1)93,
148(1)133,
158(1)117,
162(1)151,
164(1)107,
167(1)171,
168(1)105,
169(1)39,
172(1)67,
178(1)265,
190(2)167,
192(2)233,
204(1)119,
223(1)87
- interpolation,
143(1)167,
154(1)41,
157(1)3,
157(1)53,
157(1)115,
157(1)129,
157(2)259,
158(1)117,
159(2)143,
168(1)3,
168(1)39,
170(1)1,
172(1)255,
180(1)17,
180(1)243,
187(1)87,
187(1)105,
187(1)179,
187(1)z,
191(1)1,
197(1)111
- Marathe, Madhav V.,
203(1)91,
221(1)139
- maximum,
140(2)301,
145(1)357,
147(1)181,
148(1)165,
150(1)1,
158(1)117,
164(1)277,
181(1)91,
181(1)107,
181(2)307,
191(1)193,
196(1)201
- minimum,
140(2)291,
147(1)69,
158(1)117,
163(1)269,
165(2)311,
175(2)309,
181(1)57,
181(2)267,
181(2)347,
185(2)319,
188(1)1,
194(1)207,
206(1)301,
225(1)113
- natural,
140(1)5,
141(1)151,
142(2)179,
145(1)111,
145(1)189,
150(1)161,
152(1)67,
160(1)305,
161(1)205,
162(1)5,
162(2)341,
163(1)269,
163(1)283,
166(1)173,
169(1)3,
175(1)75,
175(1)z,
176(1)111,
176(1)159,
183(1)33,
185(2)217,
193(1)129,
194(1)240-1,
197(1)245,
197(1)248-1
- optimisation,
137(2)253,
138(1)3,
146(1)69,
146(1)269,
147(1)181,
147(1)267,
148(1)33,
148(2)325,
150(1)1,
156(1)217,
157(2)215,
158(1)117,
158(1)279,
162(2)225,
162(2)323,
164(1)1,
164(1)59,
172(1)265,
173(1)3,
179(1)251,
182(1)217,
188(1)129,
188(1)221,
191(1)193,
191(1)229,
194(1)207,
196(1)365,
197(1)245-2
- optimization,
142(1)27,
144(1)125,
145(1)189,
146(1)69,
146(1)145,
146(1)269,
147(1)181,
150(1)1,
156(1)217,
157(2)215,
158(1)117,
158(1)279,
173(1)3,
173(1)113,
180(1)269,
187(1)231,
191(1)229,
193(1)149,
194(1)207,
196(1)365,
207(1)203,
209(1)107,
227(1)299
- polynomial-time,
137(1)129,
137(2)279,
141(1)109,
141(1)175,
145(1)147,
145(1)241,
145(1)371,
148(2)207,
148(2)325,
150(1)1,
155(2)447,
158(1)221,
172(1)209,
181(1)159,
181(2)229,
184(1)237,
185(1)191,
191(1)215,
193(1)149,
194(1)137,
196(1)131,
207(1)89
- PSPACE-hard,
143(1)93
- Ravi, S. S.,
181(2)379,
203(1)91,
221(1)139
- restricted,
145(1)111,
154(2)165,
176(1)39,
183(2)281,
198(1)177,
203(1)151
- specified,
156(1)39
- time, polynomial-,
137(1)129,
137(2)279,
141(1)175,
145(1)147,
145(1)241,
145(1)371,
148(2)207,
148(2)325,
150(1)1,
155(2)447,
158(1)221,
172(1)209,
181(1)159,
184(1)237,
185(1)191,
191(1)215,
193(1)149,
194(1)137,
196(1)131,
207(1)89
- unit,
151(1)257,
155(2)291,
159(1)105,
175(2)349,
178(1)119,
217(1)3,
219(1)421
- vertex,
140(2)265,
145(1)27,
147(1)249,
154(2)247,
157(2)161,
158(1)117,
172(1)233,
172(1)265,
174(1)193,
175(2)239,
225(1)113